Elliptic polynomial cryptography with secret key embedding

ABSTRACT

Elliptic polynomial cryptography with secret key embedding is a method that allows for the encryption of messages through elliptic polynomial cryptography and, particularly, with the embedding of secret keys in the message bit string. The method of performing elliptic polynomial cryptography is based on the elliptic polynomial discrete logarithm problem. It is well known that an elliptic polynomial discrete logarithm problem is a computationally “difficult” or “hard” problem.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates to computerized cryptographic systems and methods for encrypting communications in a computer network or electronic communications system, and particularly to a method of performing elliptic polynomial cryptography with secret key embedding.

2. Description of the Related Art

In recent years, the Internet community has experienced explosive and exponential growth. Given the vast and increasing magnitude of this community, both in terms of the number of individual users and web sites, and the sharply reduced costs associated with electronically communicating information, such as e-mail messages and electronic files, between one user and another, as well as between any individual client computer and a web server, electronic communication, rather than more traditional postal mail, is rapidly becoming a medium of choice for communicating information. The Internet, however, is a publicly accessible network, and is thus not secure. The Internet has been, and increasingly continues to be, a target of a wide variety of attacks from various individuals and organizations intent on eavesdropping, intercepting and/or otherwise compromising or even corrupting message traffic flowing on the Internet, or further illicitly penetrating sites connected to the Internet.

Encryption by itself provides no guarantee that an enciphered message cannot or has not been compromised during transmission or storage by a third party. Encryption does not assure integrity due to the fact that an encrypted message could be intercepted and changed, even though it may be, in any instance, practically impossible, to cryptanalyze. In this regard, the third party could intercept, or otherwise improperly access, a ciphertext message, then substitute a predefined illicit ciphertext block(s), which that party, or someone else acting in concert with that party, has specifically devised for a corresponding block(s) in the message. The intruding party could thereafter transmit the resulting message with the substituted ciphertext block(s) to the destination, all without the knowledge of the eventual recipient of the message.

The field of detecting altered communication is not confined to Internet messages. With the burgeoning use of stand-alone personal computers, individuals or businesses often store confidential information within the computer, with a desire to safeguard that information from illicit access and alteration by third parties. Password controlled access, which is commonly used to restrict access to a given computer and/or a specific file stored thereon, provides a certain, but rather rudimentary, form of file protection. Once password protection is circumvented, a third party can access a stored file and then change it, with the owner of the file then being completely oblivious to any such change.

Methods of adapting discrete-logarithm based algorithms to the setting of elliptic polynomials are known. However, finding discrete logarithms in this kind of group is particularly difficult. Thus, elliptic polynomial-based crypto algorithms can be implemented using much smaller numbers than in a finite-field setting of comparable cryptographic strength. Therefore, the use of elliptic polynomial cryptography is an improvement over finite-field based public-key cryptography.

In practice, an elliptic curve group over a finite field F is formed by choosing a pair of a and b coefficients, which are elements within F. The group consists of a finite set of points P(x,y) that satisfy the elliptic curve equation F(x,y)=y²−x³−ax−b=0, together with a point at infinity, O. The coordinates of the point, x and y, are elements of F represented in N-bit strings. In the following, a point is either written as a capital letter (e.g., point P) or as a pair in terms of the affine coordinates; i.e. (x,y).

The elliptic curve cryptosystem relies upon the difficulty of the elliptic curve discrete logarithm problem (ECDLP) to provide its effectiveness as a cryptosystem. Using multiplicative notation, the problem can be described as: given points B and Q in the group, find a number k such that B^(k)=Q; where k is the discrete logarithm of Q to the base B. Using additive notation, the problem becomes: given two points B and Q in the group, find a number k such that kB=Q.

In an elliptic curve cryptosystem, the large integer k is kept private and is often referred to as the secret key. The point Q together with the base point B are made public and are referred to as the public key. The security of the system, thus, relies upon the difficulty of deriving the secret k, knowing the public points B and Q. The main factor that determines the security strength of such a system is the size of its underlying finite field. In a real cryptographic application, the underlying field is made so large that it is computationally infeasible to determine k in a straightforward way by computing all the multiples of B until Q is found.

At the heart of elliptic curve geometric arithmetic is scalar multiplication, which computes kB by adding together k copies of the point B. Scalar multiplication is performed through a combination of point-doubling and point-addition operations. The point-addition operations add two distinct points together and the point-doubling operations add two copies of a point together. To compute, for example, B=(2*(2*(2B)))+2B=Q, it would take three point-doublings and two point-additions.

Addition of two points on an elliptic curve is calculated as follows: when a straight line is drawn through the two points, the straight line intersects the elliptic curve at a third point. The point symmetric to this third intersecting point with respect to the x-axis is defined as a point resulting from the addition. Doubling a point on an elliptic curve is calculated as follows: when a tangent line is drawn at a point on an elliptic curve, the tangent line intersects the elliptic curve at another point. The point symmetric to this intersecting point with respect to the x-axis is defined as a point resulting from the doubling.

Table 1 illustrates the addition rules for adding two points (x₁, y₁) and (x₂, y₂); i.e., (x₃, y₃)=(x₁, y₁)+(x₂, y₂):

TABLE 1 Summary of Addition Rules: (x₃, y₃) = (x₁ , y₁) + (x₂, y₂) General Equations x₃ = m² − x₂ − x₁ y₃ = m (x₃ − x₁) + y₁ Point Addition $m = \frac{y_{2} - y_{1}}{x_{2} - x_{1}}$ Point Doubling $m = \frac{{3x_{1}^{2}} - a}{2y_{1}}$ (x₃, y₃) = 2(x₁,y₁) (x₂, y₂) = −(x₁, y₁) (x₂, y₂) = O (x₃, y₃) = (x₁, y₁) + (−(x₂, y₂)) = O (x₃, y₃) = (x₁, y₁) + O = (x₁, y₁)−(x₁, y₁) = (x₁, −y₁)

For elliptic curve encryption and decryption, given a message point (x_(m), y_(m)), a base point (x_(B), y_(B)), and a given key, k, the cipher point (x_(C), y_(C)) is obtained using the equation (x_(C), y_(C))=(x_(m), y_(m))+k(x_(B), y_(B)).

There are two basics steps in the computation of the above equations. The first step is to find the scalar multiplication of the base point with the key, k(x_(B), y_(B)). The resulting point is then added to the message point, (x_(m), y_(m)) to obtain the cipher point. At the receiver, the message point is recovered from the cipher point, which is usually transmitted, along with the shared key and the base point (x_(m), y_(m))=(x_(C), y_(C))−k(x_(B), y_(B)).

As noted above, the x-coordinate, x_(m), is represented as an N-bit string. However, not all of the N-bits are used to carry information about the data of the secret message. Assuming that the number of bits of the x-coordinate, x_(m), that do not carry data is L, then the extra bits L are used to ensure that message data, when embedded into the x-coordinate, will lead to an x_(m) value which satisfies the elliptic curve equation (1). Typically, if the first guess of x_(m) is not on a curve, then the second or third try will be.

Thus, the number of bits used to carry the bits of the message data is (N−L). If the secret data is a K-bit string, then the number of elliptic curve points needed to encrypt the K-bit data is

$\left\lceil \frac{K}{N - L} \right\rceil.$

It is important to note that the y-coordinate, y_(m), of the message point carries no data bits.

An attack method, referred to as power analysis exists, in which the secret information is decrypted on the basis of leaked information. An attack method in which change in voltage is measured in cryptographic processing using secret information, such as DES (Data Encryption Standard) or the like, such that the process of the cryptographic processing is obtained, and the secret information is inferred on the basis of the obtained process is known.

As one of the measures against power analysis attack on elliptic curve cryptosystems, a method using randomized projective coordinates is known. This is a measure against an attack method of observing whether a specific value appears or not in scalar multiplication calculations, and inferring a scalar value from the observed result. By multiplication with a random value, the appearance of such a specific value is prevented from being inferred.

In the above-described elliptic curve cryptosystem, attack by power analysis, such as DPA or the like, was not taken into consideration. Therefore, in order to relieve an attack by power analysis, extra calculation has to be carried out using secret information in order to weaken the dependence of the process of the cryptographic processing and the secret information on each other. Thus, time required for the cryptographic processing increases so that cryptographic processing efficiency is lowered.

With the development of information communication networks, cryptographic techniques have been indispensable elements for the concealment or authentication of electronic information. Efficiency in terms of computation time is a necessary consideration, along with the security of the cryptographic techniques. The elliptic curve discrete logarithm problem is so difficult that elliptic curve cryptosystems can make key lengths shorter than that in Rivest-Shamir-Adleman (RSA) cryptosystems, basing their security on the difficulty of factorization into prime factors. Thus, the elliptic curve cryptosystems offer comparatively high-speed cryptographic processing with optimal security. However, the processing speed is not always high enough to satisfy smart cards, for example, which have restricted throughput or servers that have to carry out large volumes of cryptographic processing.

The pair of equations for m in Table 1 are referred to as “slope equations”. Computation of a slope equation in finite fields requires one finite field division. Alternatively, the slope computation can be computed using one finite field inversion and one finite field multiplication. Finite field division and finite field inversion are costly in terms of computational time because they require extensive CPU cycles for the manipulation of two elements of a finite field with a large order. Presently, it is commonly accepted that a point-doubling and a point-addition operation each require one inversion, two multiplications, a square, and several additions. At present, there are techniques to compute finite field division and finite field inversion, and techniques to trade time-intensive inversions for multiplications through performance of the operations in projective coordinates.

In cases where field inversions are significantly more time intensive than multiplication, it is efficient to utilize projective coordinates. An elliptic curve projective point (X, Y, Z) in conventional projective (or homogeneous) coordinates satisfies the homogeneous Weierstrass equation: {tilde over (F)}(X, Y, Z)=Y²Z−aXZ²−bZ³=0, and, when Z≠0, it corresponds to the affine point

$\left( {x,y} \right) = {\left( {\frac{X}{Z},\frac{Y}{Z}} \right).}$

Other projective representations lead to more efficient implementations of the group operation, such as, for example, the Jacobian representations, where the triplets (X, Y, Z) correspond to the affine coordinates

$\left( {x,y} \right) = \left( {\frac{X}{Z^{2}},\frac{Y}{Z^{3}}} \right)$

whenever Z≠0. This is equivalent to using a Jacobian elliptic curve equation that is of the form {tilde over (F)}_(j)(X, Y, Z)=Y²−X³−aXZ⁴−bZ⁶=0.

Another commonly used projection is the Chudnovsky-Jacobian coordinate projection. In general terms, the relationship between the affine coordinates and the projection coordinates can be written as

$\left( {x,y} \right) = \left( {\frac{X}{Z^{i}},\frac{Y}{Z^{j}}} \right)$

where the values of i and j depend on the choice of the projective coordinates. For example, for homogeneous coordinates, i=1 and j=1.

The use of projective coordinates circumvents the need for division in the computation of each point addition and point doubling during the calculation of scalar multiplication. Thus, finite field division can be avoided in the calculation of scalar multiplication,

${k\left( {\frac{X_{B}}{Z_{B}^{i}},\frac{Y_{B}}{Z_{B}^{j}}} \right)},$

when using projective coordinates.

The last addition for the computation of the cipher point,

$\left( {\frac{X_{C}}{Z_{C}^{i}},\frac{Y_{C}}{Z_{C}^{j}}} \right);$

i.e., the addition of the two points

${\left( {\frac{X_{m}}{Z_{m}^{i}},\frac{Y_{m}}{Z_{m}^{j}}} \right)\mspace{14mu} {and}\mspace{14mu} {k\left( {\frac{X_{B}}{Z_{B}^{i}},\frac{Y_{B}}{Z_{B}^{j}}} \right)}},$

can also be carried out in the chosen projection coordinate:

$\left( {\frac{X_{C}}{Z_{C}^{i}},\frac{Y_{C}}{Z_{C}^{j}}} \right) = {\left( {\frac{X_{m}}{Z_{m}^{i}},\frac{Y_{m\; 1}}{Z_{m}^{j}}} \right) + {\left( {\frac{X_{B}}{Z_{B}^{i}},\frac{Y_{B}}{Z_{B}^{j}}} \right).}}$

It should be noted that Z_(m)=1.

However, one division (or one inversion and one multiplication) must still be carried out in order to calculate

${x_{C} = \frac{X_{C}}{Z_{C}^{i}}},$

since only the affine x-coordinate of the cipher point, x_(C), is sent by the sender.

Thus, the encryption of (N−L) bits of the secret message using elliptic curve encryption requires at least one division when using projective coordinates. Similarly, the decryption of a single message encrypted using elliptic curve cryptography also requires at least one division when using projective coordinates.

Thus, elliptic polynomial cryptography with secret key embedding solving the aforementioned problems is desired.

SUMMARY OF THE INVENTION

The elliptic polynomial cryptography with secret key embedding includes a method that allows for the encryption of messages through elliptic polynomial cryptography and, particularly, with the embedding of secret keys in the message bit string. The method of performing elliptic polynomial cryptography is based on the elliptic polynomial discrete logarithm problem. It is well known that an elliptic polynomial discrete logarithm problem is a computationally “difficult” or “hard” problem.

The method includes the following steps: (a) defining a maximum block size that can be embedded into (nx+1) x-coordinates and ny y-coordinates, wherein n is an integer, and setting the maximum block size to be (nx+ny+1)N bits, wherein N is an integer; (b) a sending correspondent and a receiving correspondent agree upon the values of nx and ny, and further agree on a set of coefficients a_(1k), a_(2kl), a_(3k), c_(1lki), c_(2kl), c_(3kli), b_(1l), b_(2lk), b_(3lk), b_(4k) & b_(c) ∈ F, wherein F represents a finite field where the field's elements can be represented in N-bits, the sending and receiving correspondents further agreeing on a set of random numbers k_(r,j,i), k_(s,j,i), k_(x,i,j,l), k_(y,i,j,l), where l=1, . . . N_(p), the set of random numbers being shared secret keys for communication, wherein N_(p)≧1, the sending and receiving correspondents further agreeing on a base point on an elliptic polynomial (x_(0,B), x_(1,B), . . . , x_(nx,B), y_(0,B), y_(1,B), . . . , y_(ny,B)) ∈EC^(xn+ny+2), wherein EC^(nx+ny+2) represents the elliptic polynomial.

The sending correspondent then performs the following steps: (c) establishing an integer index j such that a first block is defined by j=0, and embedding j^(th) block of a secret message bit string into an elliptic curve message point (x_(0,m,j), x_(1,m,j), . . . , x_(nx,m,j), y_(0,m,j), y_(1,m,j), . . . , y_(ny,m,j)); (d) embedding the j^(th) block shared secret key bit strings k_(x,0,j,l), k_(x,1,j,l), . . . , k_(x,nx,j,l) and k_(y,1,j,l), . . . , k_(k,ny,j,l) into a set of elliptic curve key points (xk_(x,0,j,l), xk_(x,1,j,l), . . . , xk_(x,nx,j,l), yk_(y,0,j,l), yk_(y,1,j,l), . . . , yk_(y,ny,j,l)), where l=1, . . . N_(p), and wherein the set of elliptic curve key points satisfy the elliptic polynomial at the elliptic curve message point; (e) calculating the set of elliptic curve key points (xr_(x,0,j,l), xr_(x,1,j,l), . . . , xr_(x,nx,j,l), yr_(y,0,j,l), yr_(y,1,j,l), . . . , yr_(y,ny,j,l)) as:

(xr _(x,0,j,l) , xr _(x,1,j,l) , . . . , xr _(x,nx,j,l) , yr _(y,0,j,l), yr_(y,1,j,l) , . . . , yr _(y,ny,j,l))=+k _(r,j,l)(xr _(x,0,j−1,l) , xr _(x,1,j−1,l) , . . . , xr _(x,nx,j−1,l) , yr _(y,0,j−1,l) , yr _(y,1,j−1,l) , . . . , yr _(y,ny,j−1,l)) +k _(s,j,l)(xk _(x,0,j,l) , xk _(x,1,j,l) , . . . , xk _(x,nx,j,l) , yk _(y,0,j,l) , yk _(y,1,j,l) , . . . , yk _(y,ny,j,l))

based upon the shared secret keys k_(r,j,i) and k_(s,j,i); (f) calculating a cipher point of the j^(th) data block (x_(c,0,j), x_(c,1,j) , . . . , x _(c,nx,j), y_(c,0,j), y_(c,1,j), . . . , y_(c,ny,j)) as:

${\left( {x_{c,0,j},x_{c,1,j},\ldots \;,x_{c,{nx},j},y_{c,0,j},y_{c,1,j},\ldots \;,y_{c,{ny},j}} \right) = {{+ \left( {x_{m,0,j},x_{m,1,j},\ldots \;,x_{m,{nx},j},y_{m,0,j},y_{m,1,j},\ldots \;,y_{m,{ny},j}} \right)} + {\sum\limits_{l = 1}^{N_{p}}\left( {{xr}_{x,0,j,l},{xr}_{x,1,j,l},\ldots \;,{xr}_{x,{nx},j,l},{yr}_{y,0,j,l},{y\; r_{y,1,j,l}},\ldots \;,{y\; r_{y,{ny},j,l}}} \right)}}};$

(g) sending appropriate bits of the x-coordinates and the y-coordinates of the cipher point (x_(c,0,j), x_(c,1,j), . . . , x_(c,nx,j), y_(c,0,j), y_(c,1,j), . . . , y_(c,ny,j)) to the receiving correspondent; (h) generating a new set of shared secret keys k_(r,j+1,i), k_(s,j+1,i), k_(x,i,j+1,l), k_(y,i,j+1,l) for l=1, . . . N_(p) for encryption of a following block of the message data bit string using at least one random number generators and the set of keys k_(r,j,i), k_(s,j,i), k_(x,i,j,l), k_(y,i,j,l) for l=1, . . . N_(p); and (i) returning to step (c) to encrypt the following block of the message data bit string.

The receiving correspondent then performs the following steps: (j) embedding the h^(th) block of the shared secret message bit strings k_(x,0,j,l), k_(x,1,j,l), . . . , k_(x,nx,j,l) and k_(y,1,j,l), . . . , k_(k,ny,j,l) into the elliptic curve key points (xk_(x,0,j,l), xk_(x,1,j,l), . . . , xk_(x,nx,j,l), yk_(y,0,j,l), yk_(y,1,j,l), . . . , yk_(y,ny,j,l)), wherein the set of elliptic curve key points satisfy the elliptic polynomial; (k) calculating the set of elliptic curve key points (xr_(x,0,j,l), xr_(x,1,j,l), . . . , xr_(x,nx,j,l), yr_(y,0,j,l), yr_(y,1,j,l), . . . , yr_(y,ny,j,l)) as:

(xr _(x,0,j,l) , xr _(x,1,j,l) , . . . , xr _(x,nx,j,l) , yr _(y,0,j,l) , yr _(y,1,j,l) , . . . , yr _(y,ny,j,l))=+k _(r,j,l)(xr _(x,0,j−1,l) , xr _(x,1,j−1,1) , . . . , xr _(x,nx,j−1,l) , yr _(y,0,j−1,l) , yr _(y,1,j−1,l) , . . . , yr _(y,ny,j−1,l)) +k _(s,j,l)(xk _(x,0,j,l) , xk _(x,1,j,l) , . . . , xk _(x,nx,j,l) , yk _(y,0,j,l) , yk _(y,1,j,l) , . . . , yk _(y,ny,j,l))

based upon the shared secret keys k_(r,j,i) and k_(s,j,i); (l) calculating the message point of the j^(th) data block (x_(m,0,j), x_(m,1,j), . . . , x_(m,nx,j), y_(m,0,j), y_(m,1,j), . . . , y_(m,ny,j)) as:

${\left( {x_{c,0,j},x_{c,1,j},\ldots \;,x_{c,{nx},j},y_{c,0,j},y_{c,1,j},\ldots \;,y_{c,{ny},j}} \right) = {{+ \left( {x_{m,0,j},x_{m,1,j},\ldots \;,x_{m,{nx},j},y_{m,0,j},y_{m,1,j},\ldots \;,y_{m,{ny},j}} \right)} + {\sum\limits_{l = 1}^{N_{p}}\left( {{xr}_{x,0,j,l},{xr}_{x,1,j,l},\ldots \;,{xr}_{x,{nx},j,l},{yr}_{y,0,j,l},{y\; r_{y,1,j,l}},\ldots \;,{y\; r_{y,{ny},j,l}}} \right)}}};$

(m) recovering the secret messages bit string for the j^(th) block from the appropriate x-coordinates and y-coordinates of the message point (x_(m,0,j), x_(m,1,j), . . . , x_(m,nx,j), y_(m,0,j), y_(m,1,j), . . . , y_(m,ny,j)); (n) generating the new set of shared secret keys k_(r,j+1,i), k_(s,j+1,i), k_(x,i,j+1,l), k_(y,i,j+1,l) for l=1, . . . N_(p) for the encryption of the following block of the message data bit string, using at least one random number generator and the keys k_(r,j,i), k_(s,j,i), k_(x,i,j,l), k_(y,i,j,l); and (o) returning to step (j) to encrypt the following block of the message data bit string.

These and other features of the present invention will become readily apparent upon further review of the following specification and drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

The sole drawing Figure is a block diagram illustrating system components for elliptic polynomial cryptography with secret key embedding according to the present invention.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

Elliptic polynomial cryptography with secret key embedding provides elliptic polynomial cryptographic methods based on the elliptic polynomial discrete logarithm problem. It is well known that an elliptic polynomial discrete logarithm problem is a computationally “difficult” or “hard” problem.

The secret key embedding methods to be described below use elliptic polynomials in their generation, where different elliptic polynomials are used for different blocks of the same plaintext. Particularly, the password protocols use an elliptic polynomial with more than one independent x-coordinate. More specifically, a set of elliptic polynomial points are used which satisfy an elliptic polynomial equation with more than one independent x-coordinate which is defined over a finite field F having the following properties: One of the variables (the y-coordinate) has a maximum degree of two, and appears on its own in only one of the monomials; the other variables (the x-coordinates) have a maximum degree of three, and each must appear in at least one of the monomials with a degree of three; and all monomials which contain x-coordinates must have a total degree of three.

The group of points of the elliptic polynomial with the above form is defined over additions in the extended dimensional space, and, as will be described in detail below, the method makes use of elliptic polynomials where different elliptic polynomials are used for different blocks of the same plaintext.

The particular advantage of using elliptic polynomial cryptography with more than one x-coordinate is that additional x-coordinates are used to embed extra message data bits in a single elliptic point that satisfies the elliptic polynomial equation. Given that nx additional x-coordinates are used, with nx being greater than or equal to one, a resulting elliptic point has (nx+1) x-coordinates, where all coordinates are elements of the finite field F. The number of points which satisfy an elliptic polynomial equation with nx additional x-coordinates defined over F and which can be used in the corresponding cryptosystem is increased by a factor of (#F)^(nx), where # denotes the size of a field.

Through the use of this particular method, security is increased through the usage of different elliptic polynomials for different message blocks during the secret key embedding. Further, each elliptic polynomial used for each message block is selected at random, preferably using an initial value and a random number generator.

Given the form of the elliptic polynomial equation described above, the elliptic polynomial and its twist are isomorphic with respect to one another. The method uses an embedding technique, to be described in greater detail below, which allows the embedding of a bit string into the x-coordinates of an elliptic polynomial point in a deterministic and non-iterative manner when the elliptic polynomial has the above described form. This embedding method overcomes the disadvantage of the time overhead of the iterative embedding methods used in existing elliptic polynomial.

The difficulty of using conventional elliptic polynomial cryptography for secret key embedding typically lies in the iterative and non-deterministic method needed to embed a bit string into an elliptic polynomial point, which has the drawback of the number of iterations needed being different for different bit strings which are being embedded. As a consequence, different calculation times are required for different blocks of bit strings. Such a data-dependant generation time is not suitable for secret key embedding methods, which require data independent encryption time. Further, with regard to iterative and non-deterministic methods in conventional elliptic polynomial cryptography, given an elliptic polynomial defined over a finite field that needs N-bits for the representation of its elements, only ((nx+ny+1)N−L) bits of the message data bits can be embedded in any elliptic polynomial point.

The isomorphic relationship between an elliptic polynomial and its twist, which is obtained as a result of the given form of the elliptic polynomial equation, ensures that any bit string whose equivalent binary value is an element of the underlying finite field has a bijective relationship between the bit string and a point which is either on the elliptic polynomial or its twist. This bijective relationship allows for the development of the secret key embedding to be described below.

In the conventional approach to elliptic polynomial cryptography, the security of the resulting cryptosystem relies on breaking the elliptic polynomial discrete logarithm problem, which can be summarized as: given the points k(x_(0,B), x_(1,B), . . . , x_(nx,B), y_(B)) and (x_(0,B), x_(1,B), . . . , x_(nx,B), y_(B)), find the scalar k.

Further, projective coordinates are used at the sending and receiving entities in order to eliminate inversion or division during each point addition and doubling operation of the scalar multiplication. It should be noted that all of the elliptic polynomial cryptography-based method with secret key embedding disclosed herein are scalable.

In the following, with regard to elliptic polynomials, the “degree” of a variable u^(i) is simply the exponent i. A polynomial is defined as the sum of several terms, which are herein referred to as “monomials”, and the total degree of a monomial u^(i)v^(j)w^(k) is given by (i+j+k). Further, in the following, the symbol ∈ denotes set membership.

One form of the subject elliptic polynomial equation with more than one x-coordinate and one or more y-coordinates is defined as follows: the elliptic polynomial is a polynomial with more than two independent variables such that the maximum total degree of any monomial in the polynomial is three; at least two or more of the variables, termed the x-coordinates, have a maximum degree of three, and each must appear in at least one of the monomials with a degree of three; and at least one or more variables, termed the y-coordinates, have a maximum degree of two, and each must appear in at least one of the monomials with a degree of two.

Letting S_(nx) represent the set of numbers from 0 to nx (i.e., S_(nx)={0, . . . , nx}), and letting S_(ny) represents the set of numbers from 0 to ny (i.e., S_(ny)={0, . . . , ny}), and further setting (nx+ny)≧1, then, given a finite field, F, the following equation defined over F is one example of the polynomial described above:

$\begin{matrix} {{{{\sum\limits_{k \in \; S_{ny}}{a_{1k}y_{k}^{2}}} + {\sum\limits_{k,{l \in \; S_{ny}},{l \neq k}}{a_{2\; {kl}}y_{k}y_{l}}} + {\sum\limits_{k \in \; S_{ny}}{a_{3\; k}y_{k}}} + {\sum\limits_{k,{l \in \; S_{ny}},{i \in \; S_{nx}}}{c_{1\; {kli}}y_{k}y_{l}x_{i}}} + {\sum\limits_{{k \in \; S_{ny}},{l \in \; S_{nx}}}{c_{2\; {kl}}y_{k}x_{l}}} + {\sum\limits_{{k \in \; S_{ny}},l,{i \in \; S_{nx}}}{c_{3\; {kli}}y_{k}x_{l}x_{i}}}} = {{\sum\limits_{l \in S_{nx}}{b_{1\; l}x_{l}^{3}}} + {\sum\limits_{l,{k \in \; S_{nx}},{l \neq k}}{b_{2\; {lk}}x_{l}^{2}x_{k}}} + {\sum\limits_{l,{k \in \; S_{nx}}}{b_{3\; {lk}}x_{l}x_{k}}} + {\sum\limits_{k \in \; S_{nx}}{b_{4\; k}x_{k}}} + b_{c}}},} & (1) \end{matrix}$

where a_(1l), a_(2kl), a_(3k), c_(1lki), c_(2kl), c_(3kli), b_(1l), b_(2lk), b_(3lk), b_(4k) & b_(c) ∈ F.

Two possible examples of equation (1) are y₀ ²=x₀ ³+x₁ ³+x₀x₁ and y₀ ²+x₀x₁y₀+y₀=x₀ ³+x₁ ³+x₀ ²x₁+x₀x₁ ²+x₀x₁+x₀+x₁.

With regard to the use of the elliptic polynomial equation in the addition of points of an elliptic polynomial with more than one x-coordinate and one or more y-coordinates, we may examine specific coefficients a_(1k), a_(2kl), a_(3k), c_(1lki), c_(2kl), c_(3kli), b_(1l), b_(2lk), b_(3lk), b_(4k) & b_(c) ∈ F for F, wherein a set of points EC^(nx+ny+2) is defined as the (nx+ny+2)-tuple (x₀, x₁, . . . , x_(nx), y₀, y₁, . . . , y_(ny)), where x_(i), y_(k) ∈ F, i ∈ S_(nx) and k ∈ S_(ny). This set of points comprises solutions of F, although excluding the point (0, 0, . . . , 0) and the point at infinity, (x_(0,I), x_(1,I), . . . , x_(nx,I), y_(0,I), y_(1,I), . . . , y_(ny,I)).

The rules for conventional elliptic polynomial point addition may be adopted to define an additive binary operation, “+”, over EC^(nx+ny+2), i.e., for all

(x_(0,1), x_(1,1), . . . , x_(nx,1), y_(0,1), y_(1,1), . . . , y_(ny,1)) ∈ EC^(nx+ny+2) and

(x_(0,2), x_(1,2), . . . , x_(nx,2), y_(0,2), y_(1,2), . . . , y_(ny,2)) ∈ EC^(nx+ny+2),

the sum:

(x _(0,3) , x _(1,3) , . . . , x _(nx,3) , y _(0,3) , y _(1,3) , . . . , y _(ny,3))=(x _(0,1) , x _(1,1) , . . . , x _(nx,1) , y _(0,1) , y _(1,1) , . . . , y _(ny,1))+(x _(0,2) , x _(1,2) , . . . , x _(nx,2) , y _(0,2) , y _(1,2) , . . . , y _(ny,2))

is also

(x_(0,3), x_(1,3), . . . , x_(nx,3), y_(0,3), y_(1,3), . . . , y_(ny,3)) ∈ EC^(nx+ny+2).

As will be described in greater detail below, (EC^(nx+ny+2), +) forms a pseudo-group (p-group) over addition that satisfies the following axioms:

(i) There exists a set (x_(0,I), x_(1,I), . . . , x_(nx,I), y_(0,I), y_(1,I), . . . , y_(ny,I)) ∈ EC^(nx+ny+2) such that

(x ₀ , x ₁ , . . . , x _(nx) ,y ₀ , y ₁ , . . . , y _(ny))+(x _(0,I) , x _(1,I) , . . . , x _(nx,I) , y _(o,I) , y _(1,I) , . . . , y _(ny,i)) =(x ₀ , x ₁ , . . . , x _(nx) , y ₀ , y ₁ , . . . , y _(ny))

for all (x₀, x₁, . . . , x_(nx), y₀, y₁, . . . , y_(ny)) ∈ EC^(nx+ny+2);

(ii) for every set (x₀, x₁, . . . , x_(nx), y₀, y₁, . . . , y_(ny)) ∈ EC^(nx+ny+2), there exists an inverse set, −(x₀, x₁, . . . , x_(nx), y₀y₁, . . . , y_(ny)) ∈ EC^(nx+ny+2), such

(x ₀ , x ₁ , . . . , x _(nx) , y ₀ , y ₁ , . . . , y _(ny))−(x ₀ , x ₁ , . . . , x _(nx) , y ₀ , y ₁ , . . . , y _(ny))=that (x _(0,I) , x _(1,I) , . . . , x _(nx,I) , y _(0,I) , y _(1,I) , . . . , y _(ny,I))

(iii) the additive binary operation in (EC^(nx+ny+2), +) is commutative, and the p-group (EC^(nx+ny+2), +) forms a group over addition when:

(iv) the additive binary operation in (EC^(nx+ny+2), +) is associative.

Prior to a more detailed analysis of the above axioms, the concept of point equivalence must be further developed. Mappings can be used to indicate that an elliptic point represented using (nx+1) x-coordinates and (ny+1) y-coordinates, (x₀, x₁, . . . , x_(nx), y₀, y₁, . . . , y_(ny)), is equivalent to one or more elliptic points that satisfy the same elliptic polynomial equation, including the equivalence of an elliptic point to itself.

Points that are equivalent to one another can be substituted for each other at random, or according to certain rules during point addition and/or point doubling operations. For example, the addition of two points

(x_(0,1), x_(1,1), . . . , x_(nx,1), y_(0,1), y_(1,1), . . . , y_(ny,1)) and

(x_(0,2), x_(1,2), . . . , x_(nx,2), y_(0,2), y_(1,2), . . . , y_(ny,2)) is given by:

(x _(0,3) , x _(1,3) , . . . , x _(nx,3) , y _(0,3) , y _(1,3) , . . . , y _(ny,3))=(x _(0,1) , x _(1,1) , . . . , x _(nx,1) , y _(0,1) , y _(1,1) , . . . , y _(ny,1)) +(x _(0,2) , x _(1,2) , . . . , x _(nx,2) , y _(0,2) , y _(1,2) , . . . , y _(ny,2)).

If the point (x″_(0,1), x″_(1,1), . . . , x″_(nx,1), y″_(0,1), y″_(1,1), . . . , y″_(ny,1)) is equivalent to the point (x_(0,1), x_(1,1), . . . , x_(nx,1), y_(0,1), y_(1,1), . . . , y_(ny,1)), then the former can be substituted for (x_(0,1), x_(1,1), . . . , x_(nx,1), y_(0,1), y_(1,1), . . . , y_(ny,1)) in the above equation in order to obtain:

(x _(0,3) , x _(1,3) , . . . , x _(nx,3) , y _(0,3) , y _(1,3) , . . . , y _(ny,3))=(x″ _(0,1) , x″ _(1,1) , . . . , x _(nx,1) , y″ _(0,1) , y″ _(1,1) , . . . , y″ _(ny,1)) +(x _(0,2) , x _(1,2) , . . . , x _(nx,2) , y _(0,2) , y _(1,2) , . . . , y _(ny,2)).

Mappings that are used to define equivalences can be based on certain properties that exist in elliptic polynomial equations, such as symmetry between variables. As an example, we consider the point (x₀, x₁, y₀) that satisfies the equation y₀ ²=x₀ ³+x₁ ³+x₀x₁ . The equivalent of this point may be defined as (x₁, x₀, −y₀).

With regard to the addition rules for (EC^(nx+ny+2), +), the addition operation of two points (x_(0,1), x_(1,1), . . . , x_(nx,1), y_(0,1), y_(1,1), . . . , y_(ny,1)) ∈ EC^(nx+ny+2) and (x_(0,2), x_(1,2), . . . , x_(nx,2), y_(0,2), y_(1,2), . . . , y_(ny,2)) ∈ EC^(nx+ny+2), otherwise expressed as:

(x_(0,3) , x _(1,3) , . . . , x _(nx,3), y_(0,3) , y _(1,3) , . . . , y _(ny,3))=(x _(0,1) , x _(1,1) , . . . , x _(nx,1) , y _(0,1) , y _(1,1) , . . . , y _(ny,1))+(x _(0,2) , x _(1,2) , . . . , x _(nx,2) , y _(0,2) , y _(1,2) , . . . , y _(ny,2))

is calculated in the following manner: First, a straight line is drawn which passes through the two points to be added. The straight line intersects EC^(nx+ny+2) at a third point, which we denote (x′_(0,3), x′_(1,3), . . . , x′_(nx,3), y′_(0,3), y′_(1,3), . . . , y′_(ny,3)) ∈ EC^(nx+ny+2). The sum point is defined as

(x _(0,3) , x _(1,3) , . . . , x _(nx,3) , y _(0,3) , y _(1,3) , . . . , y _(ny,3))=−(x′ _(0,3) , x′ _(1,3) , . . . , x′ _(nx,3) , y′ _(0,3) , y′ _(1,3) , . . . , y′ _(ny,3)).

From the above definition of the addition rule, addition over EC^(nx+ny+2) is commutative, that is:

(x _(0,1) , x _(1,1) , . . . , x _(nx,1) , y _(0.1) , y _(1,1) , . . . , y _(ny,1))+(x _(0,2) , x _(1,2) , . . . , x _(nx,2) , y _(0,2) , y _(1,2) , . . . , y _(ny,2))=(x _(0,2) , x _(1,2) , . . . , x _(nx,2) , y _(0,2) , y _(1,2) , . . . , y _(ny,2))+(x _(0,1) , x _(1,1) , . . . , x _(nx,1) , y _(0,1) , y _(1,1) , . . . , y _(ny,1))

for all (x_(0,1), x_(1,1), . . . , x_(nx,1) , y _(0,1) , y _(1,1) , . . . , y _(ny,1)) ∈ EC^(nx+ny+2) and for all (x_(0,2), x_(1,2), . . . , x_(nx,2), y_(0,2), y_(1,2), . . . , y_(ny,2)) ∈ EC^(nx+ny+2). This community satisfies axiom (iii) above.

There are two primary cases that need to be considered for the computation of point addition for (EC^(nx+ny+2), +): (A) for at least one j ∈ S_(nx), x_(j,1)≠x_(j,2); and (B) for all j ∈ S_(nx), x_(j,1)=x_(j,2)=x_(j,o). Case B includes three sub-cases:

i. for all k ∈ S_(ny) y_(k,1)=y_(k,2) that is:

(x _(0,1) , x _(1,1) , . . . , x _(nx,1) , y _(0,1) , y _(1,1), . . . , y_(ny,1))=(x _(0,2) , x _(1,2) , . . . , x _(nx,2) , y _(0,2) , y _(1,2), . . . , y_(ny,2))′

which corresponds to point doubling;

ii. for k ∈ S_(ny) & k≠0, y_(k,1)=y_(k,2), and where y_(0,1) & y_(0,2) are the roots of the following quadratic equation in y₀:

${{{a_{10}y_{0}^{2}} + {\sum\limits_{{k \in \; S_{ny}},{k \neq 0}}{a_{1k}y_{k,1}^{2}}} + {y_{0}\left\{ {{\sum\limits_{{k \in \; S_{ny}},{k \neq 0}}{a_{2k\; 0}y_{k,1}}} + {\sum\limits_{{l \in \; S_{ny}},{l \neq 0}}{a_{20\; l}y_{l,1}}}} \right\}} + {\sum\limits_{k,{l \in \; S_{ny}},{l \neq k},{{{l\&}k} \neq 0}}{a_{2{kl}}y_{k,1}y_{l,1}}} + {a_{30}y_{0}} + {\sum\limits_{{k \in \; S_{ny}},{k \neq 0}}{a_{3k}y_{k,1}}} + {y_{0}^{2}{\sum\limits_{i \in \; S_{nx}}{c_{100i}x_{i,1}}}} + {y_{0}\left\{ {{\sum\limits_{{k \in \; S_{ny}},{i \in \; S_{nx}}}{c_{1\; k\; 0i}y_{k,1}x_{i,1}}} + {\sum\limits_{{l \in \; S_{ny}},{i \in \; S_{nx}}}{c_{10\; {li}}y_{l,1}x_{i,1}}}} \right\}} + {\sum\limits_{k,{l \in \; S_{ny}},{{{l\&}k} \neq 0},{i \in \; S_{nx}}}{c_{1{kli}}y_{k,1}y_{l,1}x_{i,1}}} + {y_{0}{\sum\limits_{l \in \; S_{nx}}{c_{20\; l}x_{l,1}}}} + {\sum\limits_{{k \in \; S_{ny}},{k \neq 0},{l \in \; S_{nx}}}{c_{2{kl}}y_{k,1}x_{l,1}}} + {y_{0}{\sum\limits_{l,{i \in \; S_{nx}}}{c_{30\; {li}}x_{l,1}x_{i,1}}}} + {\sum\limits_{{k \in \; S_{ny}},{k \neq 0},l,{i \in \; S_{nx}}}{c_{3{kli}}y_{k,1}x_{l,1}x_{i,1}}}} = {{\sum\limits_{l \in \; S_{nx}}{b_{1\; l}x_{l,1}^{3}}} + {\sum\limits_{l,{k \in \; S_{nx}},{l \neq k}}{b_{2\; {lk}}x_{l,1}^{2}x_{k,1}}} + {\sum\limits_{l,{k \in \; S_{nx}}}{b_{3{lk}}x_{l,1}x_{k,1}}} + {\sum\limits_{k \in \; S_{nx}}{b_{4k}x_{k,1}}} + b_{c\;}}},$

which corresponds to point inverse; and

iii. all other conditions except those in Cases B.i and B.ii. This case occurs only when ny is greater than or equal to one.

For Case A, for at least one j ∈ S_(nx) x_(j,1)≠x_(j,2), a straight line in (nx+ny+2)-dimensional space is defined by

${\frac{y_{k} - y_{k,1}}{y_{k,2} - y_{k,1}} = \frac{x_{j} - x_{j,1}}{x_{j,2} - x_{j,1}}},$

k ∈ S_(ny) and j ∈ S_(nx) and

${\frac{x_{i} - x_{i,1}}{x_{i,2} - x_{i,1}} = \frac{x_{j} - x_{j,1}}{x_{j,2} - x_{j,1}}},$

i≠j, i ∈ S_(nx).

For this case, y_(k)=m_(yk)x_(j)+c_(yk), where

$m_{yk} = \frac{y_{k,2} - y_{k,1}}{x_{j,2} - x_{j,1}}$

and c_(yk)=y_(k,1)−x_(j,1)m_(yk). Further, x_(i)=m_(xi)x_(j)+c_(xi), where

$m_{xi} = \frac{x_{i,2} - x_{i,1}}{x_{j,2} - x_{j,1}}$

and c_(xi)=x_(i,1)−x_(j,1)m_(xi). Equation (1) can then be re-written as

${{{\sum\limits_{k \in \; S_{ny}}{a_{1k}y_{k}^{2}}} + {\sum\limits_{k,{l \in \; S_{ny}},{l \neq k}}{a_{2{kl}}y_{k}y_{l}}} + {\sum\limits_{k \in \; S_{ny}}{a_{3k}y_{k}}} + {x_{j}{\sum\limits_{k,{l \in \; S_{ny}}}{c_{1{klj}}y_{k}y_{l}}}} + {\sum\limits_{k,{l \in \; S_{ny}},{i \in \; S_{nx}},{i \neq j}}{c_{1{kli}}y_{k}y_{l}x_{i}}} + {x_{j}{\sum\limits_{k \in \; S_{ny}}{c_{2{kj}}y_{k}}}} + {\sum\limits_{{k \in \; S_{ny}},{l \in \; S_{nx}},{l \neq j}}{c_{2{kl}}y_{k}x_{l}}} + {x_{j}^{2}{\sum\limits_{k \in \; S_{ny}}{c_{3{kjj}}y_{k}}}} + {x_{j}{\sum\limits_{{k \in \; S_{ny}},{l \in \; S_{nx}},{l \neq j}}{c_{3{klj}}y_{k}x_{l}}}} + {x_{j}{\sum\limits_{{k \in \; S_{ny}},{i \in \; S_{nx}},{i \neq j}}{c_{3{kji}}y_{k}x_{i}}}} + {\sum\limits_{{k \in \; S_{ny}},l,{i \in \; S_{nx}},{{{l\&}i} \neq j}}{c_{3\; {kli}}y_{k}x_{l}x_{i}}}} = {{b_{1j}x_{j}^{3}} + {\sum\limits_{{l \in \; S_{nx}},{l \neq j}}{b_{1l}x_{l}^{3}}} + {x_{j}^{2}{\sum\limits_{{k \in \; S_{nx}},{k \neq j}}{b_{2{jk}}x_{k}}}} + {x_{j}{\sum\limits_{{l \in \; S_{nx}},{l \neq j}}{b_{2\; {lj}}x_{l}^{2}}}} + {\sum\limits_{l,{k \in \; S_{nx}},l,{k \neq j},{l \neq k}}{b_{2{lk}}x_{l}^{2}x_{k}}} + {b_{3{jj}}x_{j}^{2}} + {x_{j}{\sum\limits_{{k \in S_{nx}},{k \neq j}}^{\;}\; {b_{3{jk}}x_{k}}}} + {x_{j}{\sum\limits_{{l \in S_{nx}},{l \neq j}}^{\;}{b_{3{lj}}x_{l}}}} + {\sum\limits_{l,{k \in S_{nx}},l,{k \neq j}}^{\;}{b_{3{lk}}x_{l}x_{k}}} + {b_{4j}x_{j}} + {\sum\limits_{{k \in S_{nx}},{k \neq j}}^{\;}{b_{4k}x_{k}}} + b_{c}}},$

and substitution of the above into the rewritten equation (1) for y_(k), k ∈ S_(ny) and x_(i), i ∈ S_(nx) & i≠j, results in:

${{\sum\limits_{k \in S_{ny}}{a_{1k}\left( {{m_{yk}x_{j}} + c_{yk}} \right)}^{2}} + {\sum\limits_{k,{l \in S_{ny}},{l \neq k}}{{a_{2{kl}}\left( {{m_{yk}x_{j}} + c_{yk}} \right)}\left( {{m_{yl}x_{j}} + c_{yl}} \right)}} + {\sum\limits_{k \in S_{ny}}{a_{3k}\left( {{m_{yk}x_{j}} + c_{yk}} \right)}} + {x_{j}{\sum\limits_{k,{l \in S_{ny}}}{{c_{1{klj}}\left( {{m_{yk}x_{j}} + c_{yk}} \right)}\left( {{m_{yl}x_{j}} + c_{yl}} \right)}}} + {\sum\limits_{k,{l \in S_{ny}},{i \in S_{nx}},{i \neq j}}{{c_{1{kli}}\left( {{m_{yk}x_{j}} + c_{yk}} \right)}\left( {{m_{yl}x_{j}} + c_{yl}} \right)\left( {{m_{xi}x_{j}} + c_{xi}} \right)}} + {x_{j}{\sum\limits_{k \in S_{ny}}{c_{2{kj}}\left( {{m_{yk}x_{j}} + c_{yk}} \right)}}} + {\sum\limits_{{k \in S_{ny}},{l \in S_{nx}},{l \neq j}}{2_{2{kl}}\left( {{m_{yk}x_{j}} + c_{yk}} \right)\left( {{m_{xl}x_{j}} + c_{xl}} \right)}} + {x_{j}^{2}{\sum\limits_{k \in S_{ny}}{c_{3{kjj}}\left( {{m_{yk}x_{j}} + c_{yk}} \right)}}} + {x_{j}{\sum\limits_{{k \in S_{ny}},{l \in S_{nx}},{l \neq j}}{{c_{3{klj}}\left( {{m_{yk}x_{j}} + c_{yk}} \right)}\left( {{m_{xl}x_{j}} + c_{xl}} \right)}}} + {x_{j}{\sum\limits_{{k \in S_{ny}},{i \in S_{nx}},{i \neq j}}{{c_{3{kji}}\left( {{m_{yk}x_{j}} + c_{yk}} \right)}\left( {{m_{xi}x_{j}} + c_{xi}} \right)}}} + {\sum\limits_{{k \in S_{ny}},l,{i \in S_{nx}},{{{l\&}i} \neq j}}{{c_{3{kli}}\left( {{m_{yk}x_{j}} + c_{yk}} \right)}\left( {{m_{xl}x_{j}} + c_{xl}} \right)\left( {{m_{xi}x_{j}} + c_{xi}} \right)}}} = {{b_{1j}x_{j}^{3}} + {\sum\limits_{{l \in S_{nx}},{l \neq j}}{b_{1l}\left( {{m_{xl}x_{j}} + c_{l}} \right)}^{3}} + {x_{j}^{2}{\sum\limits_{{k \in S_{nx}},{k \neq j}}{b_{2{jk}}\left( {{m_{xk}x_{j}} + c_{xk}} \right)}}} + {x_{j}{\sum\limits_{{l \in S_{nx}},{l \neq j}}{b_{2{lj}}\left( {{m_{xl}x_{j}} + c_{xl}} \right)}^{2}}} + {\sum\limits_{l,{k \in S_{nx}},{{{l\&}k} \neq j},{l \neq k}}{{b_{2{lk}}\left( {{m_{xl}x_{j}} + c_{xl}} \right)}^{2}\left( {{m_{xk}x_{j}} + c_{xk}} \right)}} + {b_{3{jj}}x_{j}^{2}} + {x_{j}{\sum\limits_{{k \in S_{nx}},{k \neq j}}{b_{3{jk}}\left( {{m_{xk}x_{j}} + c_{xk}} \right)}}} + {x_{j}{\sum\limits_{l,{k \in S_{nx}},{l \neq j}}{b_{3{lj}}\left( {{m_{xl}x_{j}} + c_{xl}} \right)}}} + {\sum\limits_{l,{k \in S_{nx}},{{{l\&}k} \neq j}}{{b_{3{lk}}\left( {{m_{xl}x_{j}} + c_{xl}} \right)}\left( {{m_{xk}x_{j}} + c_{xk}} \right)}} + {b_{4j}x_{j +}{\sum\limits_{{k \in S_{nx}},{k \neq j}}{a_{6k}\left( {{m_{xk}x_{j}} + c_{xk}} \right)}}} + b_{c}}$

Expanding the terms in the above equation leads to a cubic equation of the form x_(j), C₃x_(j) ³+C₂x_(j) ²+C₁x_(j)+C₀=0, where C₃, C₂, C₁ & C₀ are obtained from the above equation.

Assuming C₃≠0, the above cubic equation in x_(j) has three roots x_(j,1)x_(j,2), & x_(j,3) and can be written as (x_(j)−x_(j,1))(x_(j)−x_(j,2))(x_(j)−x_(j,3))=0. Normalizing by the coefficient of x³ and equating the coefficients of x² in the resulting equation with that in (x_(j)−x_(j,1))(x_(j)−x_(j,2))(x_(j)−x_(j,3))=0, one obtains a solution for x′_(j,3):

$\begin{matrix} {x_{j,3}^{\prime} = {\frac{- C_{2}}{C_{3}} - x_{j,1} - {x_{j,2}.}}} & (2) \end{matrix}$

The values of y′_(k,3), k ∈ S_(ny), and x′_(i,3), i ∈ S_(nx) & i≠j, may be similarly obtained from equations for x_(j)=x′_(j,3).

For cases where C₃=0, C₃x_(j) ³+C₂x_(j) ²+C₁x_(j)=C₀=0 becomes a quadratic equation. Such quadratic equations may be used in the definition of point equivalences.

With regard to Case B for all j ∈ S_(nx), x_(j,1)=x_(j,2), the three sub-cases are considered below. In all cases, x_(j,0) is defined as x_(j,0)=x_(j,1)=x_(j,2), j ∈ S_(nx).

For Case B.i., all k ∈ S_(ny), y_(k,1)=y_(k,2), which corresponds to point doubling. In this case,

(x _(0,1) , x _(1,1) , . . . , x _(nx,1) , y _(0,1) , y _(1,1) , . . . , y _(ny,1))=(x _(0,2) , x _(1,2) , . . . , x _(nx,2) , y _(0,2) , . . . , y _(ny,2)).

Letting:

(x _(0,o) , x _(1,o) , . . . , x _(nx,o) , y _(0,o) , y _(1,o) , . . . , y _(ny,o))=(x _(0,1) , x _(1,1) , . . . , x _(nx,1) , y _(0,1) , y _(1,1) , . . . , y _(ny,1)) =(x _(0,2) , x _(1,2) , . . . , x _(nx,2) , y _(0,2) , y _(1,2) , . . . , y _(ny,2))

the sum is written as

(x _(0,3) , x _(1,3) , . . . , x _(nx,3) , y _(0,3) , y _(1,3) , . . . , y _(ny,3))=(x _(0,o) , x _(1,o) , . . . , x _(nx,o) , y _(0,o) , y _(1,o) , . . . , y _(ny,o))+(x _(0,o) , x _(1,o) , . . . , x _(nx,o) , y _(0,o) , y _(1,o) , . . . , y _(ny,o))   (3)

There are several ways of defining the addition in this case. Three possible rules are described below. Case B.i.1: Letting S_(nx,Lx) denote a subset of S_(nx) with Lx elements, i.e., S_(nx,Lx) ⊂ S_(nx); letting S_(ny,Ly) denote a subset of S_(ny) with Ly elements and which does not include the element 0; i.e. S_(ny,Ly) ⊂ S_(ny) and 0∉ S_(ny,Ly); setting the value of Lx and Ly as at least one, then the straight line in this case can be defined as a tangent to the point (x_(0,o), x_(1,o), . . . , x_(nx,o), y_(0,o), y_(1,o), . . . , y_(ny,o)) defined in a sub-dimensional space with coordinates y_(n) and x_(m) with n ∈ S_(ny,Ly) and M ∈ S_(nx,Lx).

In this case, the gradients m_(yn) and m_(xm) of the straight line to be used in equation (2) are essentially the first derivatives of y_(n) and x_(m), n ∈ S_(ny,Ly) and m ∈ S_(nx,Lx), for F with respect to x_(j), j ∈ S_(nx,Lx), i.e.,

$m_{yn} = {{\frac{y_{n}}{x_{j}}\mspace{14mu} {and}\mspace{14mu} m_{xn}} = {\frac{x_{m}}{x_{j}}.}}$

Using these derivatives for the values of the gradients,

${m_{yn} = \frac{y_{n}}{x_{j}}},$

where n ∈ S_(ny,Ly), and

${m_{yn} = \frac{x_{m}}{x_{j}}},$

where m ∈ S_(nx,Lx), in equation (2) and noting that it is assumed that

${\frac{x_{m}}{x_{j}} = 0},$

for m ∈ (S_(nx)−S_(nx,Lx)) and

${\frac{y_{n}}{x_{j}} = 0},$

for n ∈ (S_(ny)−S_(ny,Lx)) then a solution for x′_(j,3) may be obtained.

The values of y′_(n,3) for n ∈ S_(ny) and x′_(m,3), for m ∈ S_(nx) & m≠j, can further be obtained for x_(j)=x′_(j,3). The choice of the x_(m)-coordinates, m ∈ S_(nx,Lx), and y_(n)-coordinates, n ∈ S_(ny,Ly), which can be used to compute the tangent of the straight line in this case may be chosen at random or according to a pre-defined rule. Further, a different choice of the x_(m)-coordinates, m ∈ S_(nx,Lx) and y_(n)-coordinates, n ∈ S_(ny,Ly), may be made when one needs to compute successive point doublings, such as that needed in scalar multiplication.

With regard to the next case, Case B.i.2, the second possible way of defining the addition of a point with itself is to apply a sequence of the point doublings according to the rule defined above in Case B.i.1, where the rule is applied with a different selection of the x-coordinate(s) and y-coordinates(s) in each step of this sequence.

In the third sub-case, Case B.i.3, a point is substituted with one of its equivalents. Letting (x_(0,oe), x_(1,oe), . . . , x_(nx,oe), y_(0,oe), y_(1,oe), . . . , y_(ny,oe)) represent the equivalent point of (x_(0,o), x_(1,o), . . . , x_(nx,o), y_(0,o), y_(1,o), . . . , y_(ny,o)) then equation (3) may be written as:

(x _(0,3) , x _(1,3) , . . . , x _(nx,3) , y _(0,3) , y _(1,3), . . . , y_(ny,3))=(x _(0,o) , x _(1,o) , . . . , x _(nx,o) , y _(0,o) , y _(1,o) , . . . , y _(ny,o))+(x _(0,oe) , x _(1,oe) , . . . , x _(nx,oe) , y _(0,oe) , y _(1,oe) , . . . , y _(ny,oe)).

With regard to Case B.ii, for k ∈ S_(ny) & k≠0, y_(k,1)=y_(k,2), and where y_(0,1) & y_(0,2) are the roots of the quadratic equation in y₀, this case corresponds to generation of the point inverse.

Letting y_(k,1)=y_(k,2)=y_(k,o) for k ∈ S_(ny) & k≠0, then any two points, such as the point (x_(0,o), x_(1,o), . . . , x_(nx,o), y_(0,1)y_(1,o), . . . , y_(ny,o)) ∈ EC^(nx+ny+2) and the point (x_(0,o), x_(1,o), . . . , x_(nx,o), y_(0,2), y_(1,o), . . . , y_(ny,o)) ∈ EC^(nx+ny+2), are in the hyper-plane with x_(i)=x_(i,o), i ∈ S_(nx) and y_(k)=y_(k,o), k ∈ S_(ny) & k≠0 . Thus, any straight line joining these two points such that (x_(0,o), x_(1,o), . . . , x_(nx,o), y_(0,1), y_(1,o), . . . , y_(ny,o))≠(x_(0,o), x_(1,o), . . . , x_(nx,o), y_(0,2), y_(1,o), . . . , y_(ny,o)) is also in this hyper-plane.

Substituting the values of x_(0,o), x_(1,o), . . . , x_(nx,o), y_(1,o), . . . , & y_(ny,o) in an elliptic polynomial equation with multiple x-coordinates and multiple y-coordinates, a quadratic equation for y₀ is obtained, as given above. Thus, y₀ has only two solutions y_(0,1) & y_(0,2).

Thus, a line joining points (x_(0,o), x_(1,o), . . . , x_(nx,o), y_(0,1), y_(1,o), . . . , y_(ny,o)) ∈ EC^(nx+ny+2) and (x_(0,o), x_(1,o), . . . , x_(nx,o), y_(0,2), y_(1,o), . . . , y_(ny,o)) ∈ EC^(nx+ny+2) does not intersect with EC^(nx+ny+2) at a third point.

A line that joins these two points is assumed to intersect with EC^(nx+ny+2) at infinity (x_(0,I), x_(1,I), . . . , x_(nx,I), y_(0,I), y_(1,I), . . . , y_(ny,I)) ∈ EC^(nx+ny+2). This point at infinity is used to define both the inverse of a point in EC^(nx+ny+2) and the identity point. According to the addition rule defined above, one can write:

(x ₀ , x ₁ , . . . , x _(nx) , y _(0,1) , y ₁ , . . . , y _(ny))+(x ₀ , x ₁ , . . . , x _(nx) , y _(0,2) , y ₁ , . . . , y _(ny)) =(x _(0,I) , x _(1,I) , . . . , x _(nx,I) , y _(0,I) , y _(1,I) , . . . , y _(ny,I))   (4)

since the third point of intersection of such lines is assumed to be at infinity, (x_(0,I), x_(1,I), . . . , x_(nx,I) , y _(0,I), y_(1,I) , . . . , y _(ny,I)) ∈ EC^(nx+ny+2). Thus, this equation defines a unique inverse for any point (x₀, x₁, . . . , x_(nx), y₀, y₁, . . . , y_(ny)) ∈ EC^(nx+ny+2), namely:

−(x ₀ , x ₁ , . . . , x _(nx) , y _(0,1) , y ₁, . . . , y_(ny))=(x ₀ , x ₁ , . . . , x _(nx), y_(0,2) , y ₁ , . . . , y _(ny)).

Thus, equation (4) can be written as:

(x ₀ , x ₁ , . . . , x _(nx) , y _(0,1) , y ₁ , . . . , y _(ny))−(x ₀ , x ₁ , . . . , x _(nx) , y _(0,1) , y ₁ , . . . , y _(ny)) =(x _(0,I) , x _(1,I) , . . . , x _(nx,I) , y _(0,I) , y _(1,I) , . . . , y _(ny,I))   (5).

Further, a line joining the point at infinity (x_(0,I), x_(1,I), . . . , x_(nx,I), y_(0,I), y_(1,I), . . . , y_(ny,I)) ∈ EC^(nx+ny+2) and a point (x₀, x₁, . . . , x_(nx), y_(0,1), y₁, . . . , y_(ny)) ∈ EC^(nx+ny+2) will intersect with EC^(nx+ny+2) at (x₀, x₁, . . . , x_(nx), y_(0,2), y₁, . . . , y_(ny)) ∈ EC^(nx+ny+2). Thus, from the addition rule defined above,

(x ₀ , x ₁ , . . . , x _(nx) , y ₀ , y ₁ , y ₂ , . . . , y _(ny))+(x _(0,I) , x _(1,I) , . . . , x _(nx,I) , y _(0,I) , y _(1,I), . . . , y_(ny,I)) =(x ₀ , x ₁ , x _(nx) , y ₀ , y ₁, . . . , y_(ny))   (6)

Equation (5) satisfies axiom (ii) while equation (6) satisfies axiom (i), defined above.

Case B.iii applies for all other conditions except those in cases B.i and B.ii. This case occurs only when ny is greater than or equal to one. Given two points (x_(0,o), x_(1,o), . . . , x_(nx,o), y_(0,1), y_(1,1), . . . , y_(ny,1)) ∈ EC^(nx+ny+2) and (x_(0,o), x_(1,o), . . . , x_(nx,o)y_(0,2), y_(1,2), . . . , y_(ny,2)) ∈ EC^(nx+ny+2) that do not satisfy the conditions of cases B.i and B.ii above, the sum point is written as

(x _(0,3) , x _(1,3) , . . . , x _(nx,3) , y _(0,3) , y _(1,3) , . . . , y _(ny,3))=(x _(0,o) , x _(1,o) , . . . , x _(nx,o) , y _(0,1) , y _(y) _(1,1) , . . . , y _(ny,1))+(x _(0,o) , x _(1,o) , . . . , x _(nx,o) , y _(0,2) , y _(1,2) , . . . , y _(ny,2))

There are several possible rules to find the sum point in this case. Three possible methods are given below:

1) Using three point doublings and one point addition,

(x _(0,3) , x _(1,3) , . . . , x _(nx,3) , y _(0,3) , y _(1,3) , . . . , y _(ny,3))=4(x _(0,o) , x _(1,o) , . . . , x _(nx,o) , y _(0,1) , y _(1,1) , . . . , y _(ny,1)); −2(x _(0,o) , x _(1,o) , . . . , x _(nx,o) , y _(0,2) , y _(1,2) , . . . , y _(ny,2))

2) using one point doublings and three point additions,

(x _(0,3) , x _(1,3) , . . . , x _(nx,3) , y _(0,3) , y _(1,3) , . . . , y _(ny,3))=(2(x _(0,o) , x _(1,o) , . . . , x _(nx,o) , y _(0,1) , y _(1,1) , . . . , y _(ny,1)) +(x _(0,o) , x _(1,o) , . . . , x _(nx,o) , x _(0,2) , y _(1,2) , . . . , y _(ny,2)))−; and (x _(0,o) , x _(1,o) , . . . , x _(nx,o) , y _(0,1) , y _(1,1) , . . . , y _(ny,1))

3) using point equivalence,

(x _(0,3) , x _(1,3) , . . . , x _(nx,3) , y _(0,3) , y _(1,3) , . . . , y _(ny,3))=(x _(0,o) , x _(1,o) , . . . , x _(nx,o) , y _(0,1) , y _(1,1) , . . . , y _(ny,1))+(x _(0,oe) , x _(1,oe) , . . . , x _(nx,oe) , y _(0,2e) , y _(1,2e) , . . . , y _(ny,2e)),

where (x_(0,oe), x_(1,oe), . . . , x_(nx,oe), y_(0,2e), . . . , y_(1,2e), . . . , y_(ny,2e)) is assumed to be the equivalent point of (x_(0,o), x_(1,o), . . . , x_(nx,o), y_(0,2), y_(1,2), . . . , y_(ny,2)).

It should be noted that the above methods for defining the sum point are not the only ones that can be defined and are provided for exemplary purposes only. The choice of method used to obtain the sum point in this case should depend on the computation complexity of point addition and point doubling.

With regard to associativity, one way of proving associativity of (EC^(nx+ny+2), +) is as follows: Given particular elliptic polynomial equations (i.e., for particular coefficients a_(1l), a_(2kl), a_(3k), c_(1lki), c_(2kl), c_(3kli), b_(1l), b_(2lk), b_(3lk), b_(4k), b_(c) ∈ F) defined over a finite F, if it can be shown by computation that any point Q ∈ EC^(nx+ny+2) (and any of its equivalent points) can be uniquely written as k_(Q)P ∈ EC^(nx+ny+2), where P is the generator point of (EC^(nx+ny+2), +), then the corresponding EC^(nx+ny+2) groups based on such polynomials are associative. This is because any three points Q, R, S ∈ EC^(nx+ny+2) (or any of their equivalent points) can be written as k_(Q)P, k_(R)P, k_(S)P ∈ EC^(nx+ny+2), respectively, thus their sum (Q+R+S)=(k_(Q)P+k_(R)P+k_(S)P)=(k_(Q)+k_(R)+k_(S))P can be carried out in any order.

The following elliptic polynomial equation with nx=1 and ny=0 is used to show an example of the equations in Case A used in point addition: y₀ ²=x₀ ³+x₁ ³+x₀x₁. Choosing x_(j)=x₀, and substituting y_(k)=m_(yk)x_(j)+c_(yk) from Case A above for y₀, and the corresponding equation x_(i)=m_(xi)x_(j)+c_(xi) for x₁, one obtains (m_(y0)x₀+c_(y0))²=x₀ ³+(m_(xi)x₀+c_(x1))³+x₀(m_(x1)x₀+c_(x1)).

Expanding this equation yields the equation

m _(y0) ² x ₀ ²+2m _(y0) c _(y0) x ₀ +c _(y0) ² =x ₀ ³ +m _(x1) ³ x ₀ ³+3m _(m1) ² c _(x1) x ₀ ²+3m _(m1) c _(x1) ² x ₀ +c _(x1) ³ +m _(x1) x ₀ ² +c _(x1) x ₀

or

(1+m _(x1) ³)x ₀ ³+(3m _(x1) ² c _(x1) +m _(x1) −m _(y0) ²)x ₀ ²+(3m _(x1) c _(x1) ² +c _(x1)−2m _(y0) c _(y0))x ₀ +c _(x1) ³ −c _(y0) ²=0.

From equation (2), the solution for x′_(0,3) in this case is obtained:

$x_{0,3}^{\prime} = {\frac{- \left( {{3m_{xl}^{2}c_{x\; 1}} + m_{x\; 1} - m_{y\; 0}^{2}} \right)}{\left( {1 + m_{x\; 1}^{3}} \right)} - x_{j,1} - {x_{j,2}.}}$

Similarly, one can obtain the values of y_(0,3) and x′_(1,3) for x₀=x′_(0,3).

It should be noted that when m_(x1)=−1, the coefficient of the cubic term in the above is zero; i.e. C₃=0. In this case, the resulting quadratic equation can be used in the definition of point equivalences for the points that satisfy the elliptic polynomial equation.

Each of the equations for point addition and point doublings derived for cases A and B above require modular inversion or division. In cases where field inversions or divisions are significantly more expensive (in terms of computational time and energy) than multiplication, projective coordinates are used to remove the requirement for field inversion or division from these equations.

Several projective coordinates can be utilized. In the preferred embodiment, the Jacobean projective coordinate system is used. As an example, we examine:

$\begin{matrix} {{x_{i} = {{\frac{X_{i}}{V^{2}}\mspace{14mu} {for}\mspace{14mu} i} \in S_{nx}}};{and};{and}} & (7) \\ {y_{k} = {{\frac{Y_{k}}{V^{3}}\mspace{14mu} {for}\mspace{14mu} k} \in {S_{ny}.}}} & (8) \end{matrix}$

Using Jacobian projection yields:

$\begin{matrix} {{{\sum\limits_{k \in S_{ny}}{a_{1k}\frac{Y_{k}^{2}}{V^{6}}}} + {\sum\limits_{k,{l \in S_{ny}},{l \neq k}}{a_{2{kl}}\frac{Y_{k}}{V^{3}}\frac{Y_{l}}{V^{3}}}} + {\sum\limits_{k \in S_{ny}}{a_{3k}\frac{Y_{k}}{V^{3}}}} + {\sum\limits_{k,{l \in S_{ny}},{i \in S_{nx}}}{c_{1{kli}}\frac{Y_{k}}{V^{3}}\frac{Y_{l}}{V^{3}}\frac{X_{i}}{V^{2}}}} + {\sum\limits_{{k \in S_{ny}},{l \in S_{nx}}}{c_{2{kl}}\frac{Y_{k}}{V^{3}}\frac{X_{l}}{V^{2}}}} + {\sum\limits_{{k \in S_{ny}},l,{i \in S_{nx}}}{c_{3{kli}}\frac{Y_{k}}{V^{3}}\frac{X_{l}}{V^{2}}\frac{X_{i}}{V^{2}}}}} = {{\sum\limits_{l \in S_{nx}}{b_{1l}\frac{X_{l}^{3}}{V^{6}}}} + {\sum\limits_{l,{k \in S_{nx}},{l \neq k}}{b_{2{lk}}\frac{X_{l}^{2}}{V^{4}}\frac{X_{k}}{V^{2}}}} + {\sum\limits_{l,{k \in S_{nx}}}{b_{3{lk}}\frac{X_{l}}{V^{2}}\frac{X_{k}}{V^{2}}}} + {\sum\limits_{k \in S_{nx}}{b_{4k}\frac{X_{k}}{V^{2}}}} + b_{c}}} & (9) \end{matrix}$

which can be rewritten as:

$\begin{matrix} {{{\sum\limits_{k \in S_{ny}}{a_{1k}Y_{k}^{2}V^{2}}} + {\sum\limits_{k,{l \in S_{ny}},{l \neq k}}{a_{2{kl}}Y_{k}Y_{l}V^{2}}} + {\sum\limits_{k \in S_{ny}}{a_{3k}Y_{k}v^{5}}} + {\sum\limits_{k,{l \in S_{ny}},{i \in S_{nx}}}{c_{1{kli}}Y_{k}Y_{l}X_{i}}} + {\sum\limits_{{k \in S_{ny}},{l \in S_{nx}}}{c_{2{kl}}Y_{k}X_{l}V^{3}}} + {\sum\limits_{{k \in S_{ny}},l,{i \in S_{nx}}}{c_{3{kli}}Y_{k}X_{l}X_{i}V}}} = {{\sum\limits_{l \in S_{nx}}{b_{1l}X_{l}^{3}V^{2}}} + {\sum\limits_{l,{k \in S_{nx}},{l \neq k}}{b_{2{lk}}X_{l}^{2}X_{k}V^{2}}} + {\sum\limits_{l,{k \in S_{nx}}}{b_{3{lk}}X_{l}X_{k}V^{4}}} + {\sum\limits_{k \in S_{nx}}{b_{4k}X_{k}V^{6}}} + {b_{c}{V^{8}.}}}} & (10) \end{matrix}$

In the following, the points (X₀, X₁, . . . , X_(nx), Y₀, Y₁, . . . , Y_(ny), V) are assumed to satisfy equation (10). When V≠0, the projected point (X₀, X₁, . . . , X_(nx), Y₀, Y₁, . . . , Y_(ny), V) corresponds to the point:

${\left( {x_{0},x_{1},\ldots \mspace{14mu},x_{nx},y_{0},y_{1},\ldots \mspace{14mu},y_{ny}} \right) = \left( {\frac{X_{0}}{V^{2}},\frac{X_{1}}{V^{2}},\ldots \mspace{14mu},\frac{X_{nx}}{V^{2}},\frac{Y_{0}}{V^{3}},\frac{Y_{1}}{V^{3}},\ldots \mspace{14mu},\frac{Y_{ny}}{V^{3}}} \right)},$

which satisfies equation (1).

Using Jacobean projective coordinates, equation (10) can be written as:

$\begin{matrix} {\left( {\frac{X_{0,3}}{V_{3}^{2}},\frac{X_{1,3}}{V_{3}^{2}},\ldots \mspace{14mu},\frac{X_{{nx},3}}{V_{3}^{2}},\frac{Y_{0,3}}{V_{3}^{3}},\frac{Y_{1,3}}{V_{3}^{3}},\ldots \mspace{14mu},\frac{Y_{{ny},3}}{V_{3}^{3}}} \right) = {\left( {\frac{X_{0,1}}{V_{1}^{2}},\frac{X_{1,1}}{V_{1}^{2}},\ldots \mspace{14mu},\frac{X_{{nx},1}}{V_{1}^{2}},\frac{Y_{0,1}}{V_{1}^{3}},\frac{Y_{1,1}}{V_{1}^{3}},\ldots \mspace{14mu},\frac{Y_{{ny},1}}{V_{1}^{3}}} \right) + {\left( {\frac{X_{0,2}}{V_{2}^{2}},\frac{X_{1,2}}{V_{2}^{2}},\ldots \mspace{14mu},\frac{X_{{nx},2}}{V_{2}^{2}},\frac{Y_{0,2}}{V_{2}^{3}},\frac{Y_{1,2}}{V_{2}^{3}},\ldots \mspace{14mu},\frac{Y_{{ny},2}}{V_{2}^{3}}} \right).}}} & (11) \end{matrix}$

By using Jacobian projective coordinates in the equations of Cases A and B above, and by an appropriate choice of the value of V₃, it can be shown that point doubling and point addition can be computed without the need for field inversion or division.

In order to examine the embedding method, the twist of an elliptic polynomial equation needs to be defined. Given an elliptic polynomial with (nx+1) x-coordinates and (ny+1) y-coordinates of the form described above:

$\begin{matrix} {{{y_{0}^{2} + {\sum\limits_{k \in S_{ny}}{a_{1k}y_{k}^{2}}} + {\sum\limits_{k,{l \in S_{ny}},{l \neq k}}{a_{2{kl}}y_{k}y_{l}}}} = {{\sum\limits_{l \in S_{nx}}{b_{1l}x_{l}^{3}}} + {\sum\limits_{l,{k \in S_{nx}},{l \neq k}}{b_{2{lk}}x_{l}^{2}x_{k}}}}},} & (12) \end{matrix}$

where a_(1l), a_(2kl), b_(1l), b_(2lk) ∈ F.

Given certain values for the x-coordinates x_(0,o), x_(1,o), . . . , x_(nx,o) and y-coordinates y_(1,o), . . . , y_(ny,o), respectively, that are elements of the finite field, F, these values are substituted into the elliptic polynomial equation (1) in order to obtain a quadratic equation in y₀:

$y_{0}^{2} = {{{- {\sum\limits_{k \in S_{ny}}{a_{1k}y_{k,o}^{2}}}} - {\sum\limits_{k,{l \in S_{ny}},{l \neq k}}{a_{2{kl}}y_{k,o}y_{l,o}}} + {\sum\limits_{l \in S_{nx}}{b_{1l}x_{l,o}^{3}}} + {\sum\limits_{l,{k \in S_{nx}},{l \neq k}}{b_{2{lk}}x_{l,o}^{2}x_{k,o}}}} = {T.}}$

If a solution of the above quadratic equation (i.e., y₀ ²=T) is an element of the finite field F, the point (x_(0,o), x_(1,o), . . . , x_(nx,o), y₀, y_(1,o), . . . , y_(ny,o)) is said to satisfy the given elliptic polynomial equation. If a solution of the above quadratic equation is not an element of the finite field F, the point (x_(0,o), x_(1,o), . . . , x_(nx,o), y₀, y_(1,o), . . . , y_(ny,o)) is said to satisfy the twist of the given elliptic curve equation. The inventive embedding method is based on the isomorphic relationship between a curve and its twist as described in the following theorem:

An elliptic polynomial equation of the form given above is isomorphic to its twist if:

-   -   1) there are mathematical mappings that can be defined on the         values of x₀, x₁, . . . , x_(nx), y₁, . . . , y_(ny) (i.e.,         φ_(x)(x_(i)) and φ_(y)(y_(i))) such that any point (x₀, x₁, . .         . , x_(nx), y₀, y₁, . . . , y_(ny)) that satisfies such an         elliptic polynomial equation can be mapped into another point         (φ_(x)(x₀), φ_(x)(x₁), . . . , φ_(x)(x_(xn)), φ_(y)(y₀),         φ_(y)(y₁), . . . , φ_(y)(y_(ny))) that satisfies the twist of         the same elliptic polynomial equation; and     -   2) the mapping between the points (x_(o), x₁, . . . , x_(nx),         y₀, y₁, . . . , y_(ny)) and (φ_(x)(x₀), φ_(x)(x₁), . . . ,         φ_(x)(x_(xn)), φ_(y)(y₀), φ_(y)(y₁), . . . , φ_(y)(y_(ny))), is         unique, i.e., a one-to-one correspondence.

The proof of this theorem is as follows. Re-writing equation (12) as:

$\begin{matrix} {{y_{0}^{2} = {{- {\sum\limits_{k \in S_{n\; y}}{a_{1k}y_{k}^{2}}}} - {\sum\limits_{k,{l \in S_{n\; y}},{l \neq k}}{a_{2k\; l}y_{k}y_{l}}} + {\sum\limits_{l \in S_{n\; x}}{b_{1l}x_{l}^{3}}} + {\sum\limits_{l,{k \in S_{n\; x}},{l \neq k}}{b_{2l\; k}x_{l}^{2}x_{k}}}}},} & {(13),} \end{matrix}$

and letting the right-hand side of equation (13) be denoted as T, then:

$\begin{matrix} {T = {{- {\sum\limits_{k \in S_{n\; y}}{a_{1k}y_{k}^{2}}}} - {\sum\limits_{k,{l \in S_{n\; y}},{l \neq k}}{a_{2k\; l}y_{k}y_{l}}} + {\sum\limits_{l \in S_{n\; x}}{b_{1l}x_{l}^{3}}} + {\sum\limits_{l,{k \in S_{n\; x}},{l \neq k}}{b_{2l\; k}x_{l}^{2}{x_{k}.}}}}} & (14) \end{matrix}$

Thus, any value of x₀, x₁, . . . , x_(nx), y₁, . . . , y_(ny) will lead to a value of T ∈ F(p). T could be quadratic residue or non-quadratic residue. If T is quadratic residue, then equation (14) is written as:

$\begin{matrix} {T_{q} = {{- {\sum\limits_{k \in S_{n\; y}}{a_{1k}y_{k,q}^{2}}}} - {\sum\limits_{k,{l \in S_{n\; y}},{l \neq k}}{a_{2k\; l}y_{k,q}y_{l,q}}} + {\sum\limits_{l \in S_{n\; x}}{b_{1l}x_{l,q}^{3}}} + {\sum\limits_{l,{k \in S_{n\; x}},{l \neq k}}{b_{2l\; k}x_{l,q}^{2}x_{k,q}}}}} & (15) \end{matrix}$

where x_(0,q), x_(1,q), . . . , x_(nx,q), y_(1,q), . . . , y_(ny,q) ∈ F denotes the values of x₀, x₁, . . . , x_(nx), y₁, . . . , y_(ny) that result in a quadratic residue value of T, which is hereafter denoted as T_(q).

If T is non-quadratic residue, then equation (14) is written as:

$\begin{matrix} {T_{\overset{\_}{q}} = {{- {\sum\limits_{k \in S_{n\; y}}{a_{1k}y_{k,\overset{\_}{q}}^{2}}}} - {\sum\limits_{k,{l \in S_{n\; y}},{l \neq k}}{a_{2k\; l}y_{k,\overset{\_}{q}}y_{l,\overset{\_}{q}}}} + {\sum\limits_{l \in S_{n\; x}}{b_{1l}x_{l,\overset{\_}{q}}^{3}}} + {\sum\limits_{l,{k \in S_{n\; x}},{l \neq k}}{b_{2l\; k}x_{l,\overset{\_}{q}}^{2}x_{k,\overset{\_}{q}}}}}} & (16) \end{matrix}$

where x_(0, q) , x_(1, q) , . . . , x_(nx, q) , y_(1, q) , . . . , y_(ny, q) ∈ F denotes the values of x₀, x₁, . . . , y₁, . . . , y_(ny) that result in a non-quadratic residue value of T, denoted as T _(q) .

Letting g be any non-quadratic residue number in F (i.e., g ∈ F(p) & √{square root over (g)}∉ F(p)), then multiplying equation (15) with g³ yields:

${{g^{3}T_{q}} = {{{- g^{3}}{\sum\limits_{k \in S_{n\; y}}{a_{1k}y_{k,q}^{2}}}} - {g^{3}{\sum\limits_{k,{l \in S_{n\; y}},{l \neq k}}{a_{2k\; l}y_{k,q}y_{l,q}}}} + {g^{3}{\sum\limits_{l \in S_{n\; x}}{b_{1l}x_{l,q}^{3}}}} + {g^{3}{\sum\limits_{l,{k \in S_{n\; x}},{l \neq k}}{b_{2l\; k}x_{l,q}^{2}x_{k,q}}}}}},$

which can be re-written as:

$\begin{matrix} {{g^{3}T_{q}} = {{- {\sum\limits_{k \in S_{n\; y}}{a_{1k}\left( {\sqrt{g^{3}}y_{k,q}} \right)}^{2}}} - {\sum\limits_{k,{l \in S_{n\; y}},{l \neq k}}{a_{2k\; l}{g^{3}\left( {\sqrt{g^{3}}y_{k,q}} \right)}\left( {\sqrt{g^{3}}y_{l,q}} \right)}} + {\sum\limits_{l \in S_{n\; x}}{b_{1l}\left( {g\; x_{l,q}} \right)}^{3}} + {\sum\limits_{l,{k \in S_{n\; x}},{l \neq k}}{{b_{2l\; k}\left( {g\; x_{l,q}} \right)}^{2}{\left( {g\; x_{k,q}} \right).}}}}} & (17) \end{matrix}$

It should be noted that if g is non-quadratic residue, then g³ is also non-quadratic residue. Further, the result of multiplying a quadratic residue number by a non-quadratic residue number is a non-quadratic residue number. Thus, g³T_(q) is non-quadratic residue.

By comparing the terms of equations (16) and (17), we obtain the following mappings:

x_(i, q) =gx_(i,q);   (18);

y_(i), q =√{square root over (g³)}y_(i,q);   (19); and

T _(q) =g³T_(q)   (20).

The mappings between the variables x_(i,q) and x_(i, q) in equation (18), y_(i,q) and y_(i, q) in equation (19), and T_(q) and T _(q) in equation (20) are all bijective, i.e., there is a one-to-one correspondence from basic finite field arithmetic. As a consequence, the mappings between the (nx+ny+2)-tuple (x_(0,q), x_(1,q), . . . , x_(nx,q), T_(q), y_(1,q), . . . , y_(ny,q)) and the (nx+ny+2)-tuple (x_(0, q) , x_(1, q) , . . . , x_(nx, q) , T _(q) , y_(1, q) , . . . , y_(ny, q) ) are also bijective.

Therefore, for every solution of equation (15), there is an isomorphic solution that satisfies equation (16), and since the mappings of the coordinates of one to the other are given in equations (18)-(20), these two solutions are isomorphic with respect to each other.

Since T_(q) is quadratic residue, this expression can be written as:

T_(q)=y₀ ².   (21)

Thus, from equation (20), T _(q) can be written as:

T _(q) =g³y₀ ²   (22).

Using equations (21) and (22), equations (15) and (16) can be written as:

$\begin{matrix} {{y_{0}^{2} = {{- {\sum\limits_{k \in S_{n\; y}}{a_{1k}y_{k,q}^{2}}}} - {\sum\limits_{k,{l \in S_{n\; y}},{l \neq k}}{a_{2k\; l}y_{k,q}y_{l,q}}} + {\sum\limits_{l \in S_{n\; x}}{b_{1l}x_{l,q}^{3}}} + {\sum\limits_{l,{k \in S_{n\; x}},{l \neq k}}{b_{2l\; k}x_{l,q}^{2}x_{k,q}}}}};} & (23) \\ {\mspace{20mu} {and}} & \; \\ {{g^{3}y_{0}^{2}} = {{- {\sum\limits_{k \in S_{n\; y}}{a_{1k}y_{k,\overset{\_}{q}}^{2}}}} - {\sum\limits_{k,{l \in S_{n\; y}},{l \neq k}}{a_{2k\; l}y_{k,\overset{\_}{q}}y_{l,\overset{\_}{q}}}} + {\sum\limits_{l \in S_{n\; x}}{b_{1l}x_{l,\overset{\_}{q}}^{3}}} + {\sum\limits_{l,{k \in S_{n\; x}},{l \neq k}}{b_{2l\; k}x_{l,\overset{\_}{q}}^{2}{x_{k,\overset{\_}{q}}.}}}}} & (24) \end{matrix}$

Since any solution of equation (15) has an isomorphic solution that satisfies equation (16), it follows that the solution of equation (23), denoted as (x_(0,q), x_(1,q), . . . , x_(nx,q), y₀, y_(1,q), . . . , y_(ny,q)), has an isomorphic solution that satisfies equation (24), denoted as

$\left( {{g\; x_{0,q}},{g\; x_{1,q}},\ldots \mspace{14mu},{g\; x_{{n\; x},q}},{g^{\frac{3}{2}}y_{0}},{g^{\frac{3}{2}}y_{1,q}},\ldots \mspace{14mu},{g^{\frac{3}{2}}y_{{n\; y},q}}} \right).$

The solutions of equation (23) form the points (s_(0,q), x_(1,q), . . . , x_(nx,q), y₀, y_(1,q), . . . , y_(ny,q)) that satisfy an elliptic polynomial. Similarly, the solutions of equation (24) form the points

$\left( {{g\; x_{0,q}},{g\; x_{1,q}},\ldots \mspace{14mu},{g\; x_{{n\; x},q}},{g^{\frac{3}{2}}y_{0}},{g^{\frac{3}{2}}y_{1,q}},\ldots \mspace{14mu},{g^{\frac{3}{2}}y_{{n\; y},q}}} \right)$

that satisfy its twist. This proves the above theorem.

An example of a mapping of the solutions of equation (23) defined over F(p), where p=3 mod 4, to the solutions of its twist is implemented by using −x_(i) for the x-coordinates and −y_(i) ² for the y-coordinates.

The isomorphism between an elliptic polynomial and its twist, discussed above, is exploited for the embedding of the bit sting of a shared secret key into the appropriate x and y coordinates of an elliptic polynomial point without the need for an iterative search for a quadratic residue value of the corresponding y₀-coordinate, which usually requires several iterations, where the number of iterations needed is different for different bit strings which are being embedded.

Assuming F=F(p) and that the secret key is an M-bit string such that (nx+ny+1)N>M>N−1, where N is the number of bits needed to represent the elements of F(p), then the secret key bit string is divided into (nx+ny+1) bit-strings k_(x,0), k_(x,1), . . . , k_(x,nx), k_(y,1), . . . , k_(k,ny). The value of the bit-strings k_(x,0), k_(x,1), . . . , k_(x,nx), k_(y,1), . . . , k_(k,ny) must be less than p. In the preferred embodiment of embedding the (nx+ny+1) bit-strings k_(x,0), k_(x,1), . . . , k_(x,nx), k_(y,1), . . . , k_(k,ny), the embedding is as follows.

First, assign the value of the bit string of k_(x,0), k_(x,1), . . . , k_(x,nx) to x_(0,k), x_(1,k), . . . , x_(nx,k). Next, assign the value of the bit string of k_(y,1), . . . , k_(k,ny) to y_(1,k), . . . , y_(ny,k). Then, compute:

$T = {{- {\sum\limits_{i \in S_{n\; y}}{a_{1i}y_{i,k}^{2}}}} - {\sum\limits_{i,{l \in S_{n\; y}},{l \neq i}}{a_{2i\; l}y_{i,k}y_{l,k}}} + {\sum\limits_{l \in S_{n\; x}}{b_{1l}x_{l,k}^{3}}} + {\sum\limits_{l,{i \in S_{n\; x}},{l \neq i}}{b_{2l\; i}x_{l,k}^{2}{x_{i,k}.}}}}$

Finally, use the Legendre test to see if T has a square root. If T has a square root, assign one of the roots to y₀; otherwise, the x-coordinates and y-coordinates of the elliptic polynomial point with the embedded shared secret key bit string are given by gx_(i,k) and

${g^{\frac{3}{2}}y_{i,k}},$

respectively, where g is non-quadratic residue in F.

It should be noted that p is usually predetermined prior to encryption, so that the value of g can also be predetermined. Further, the receiver can identify whether the point (x,_(0,k), x_(1,k), . . . , x_(nx,k), y_(0,k), . . . , y_(ny,k)) or the point

$\left( {{g\; x_{0,k}},{g\; x_{1,k}},\ldots \mspace{14mu},{g\; x_{{n\; x},k}},{g^{\frac{3}{2}}y_{0,k}},{g^{\frac{3}{2}}y_{1,k}},\ldots \mspace{14mu},{g^{\frac{3}{2}}y_{{n\; y},k}}} \right)$

is the elliptic polynomial point with the embedded secret key bit strings without any additional information. Additionally, any non-quadratic value in F(p) can be used for g. For efficiency, g is chosen to be −1 for p≡3 mod 4 and g is chosen to be 2 for p≡1 mod 4 .

The same deterministic and non-iterative method described above can be used to embed a secret message bit string into an elliptic polynomial point in a deterministic and non-iterative manner. Assuming F=F(p) and that the message is an M-bit string such that (nx+ny+1)N>M>N−1, where N is the number of bits needed to represent the elements of F(p), then the message bit string is divided into (nx+ny+1) bit-strings m_(x,0), m_(x,1), . . . , m_(x,nx), m_(y,1). . . , m_(k,ny). The value of the bit-strings m_(x,0), m_(x,1), . . . , m_(x,nx), m_(y,1), . . . , m_(k,ny) must be less than p. As the previous embodiment, the embedding of the (nx+ny+1) bit-strings m_(x,0), m_(x,1), . . . , m_(x,nx), m_(y,1), . . . , m_(k,ny) can be accomplished out as follows.

First, assign the value of the bit string of m_(x,0), m_(x,1), . . . , m_(x,nx) to x_(0,m), x_(1,m), . . . , x_(nx,m). Next, assign the value of the bit string of m_(y,1), . . . , m_(k,ny) to y_(1,m), . . . , y_(ny,m). Then compute:

$T = {{- {\sum\limits_{i \in S_{n\; y}}{a_{1i}y_{i,m}^{2}}}} - {\sum\limits_{i,{l \in S_{n\; y}},{l \neq i}}{a_{2i\; l}y_{i,m}y_{l,m}}} + {\sum\limits_{l \in S_{n\; x}}{b_{1l}x_{l,m}^{3}}} + {\sum\limits_{l,{i \in S_{n\; x}},{l \neq i}}{b_{2l\; i}x_{l,m}^{2}{x_{i,m}.}}}}$

Finally, use the Legendre test to see if T has a square root. If T has a square root, then assign one of the roots to y₀, otherwise the x-coordinates and y-coordinates of the elliptic polynomial point with the embedded shared secret key bit string are given by gx_(i,m) and

${g^{\frac{3}{2}}y_{i,m}},$

respectively.

It should be noted that p is usually predetermined prior to encryption; thus, the value of g can also be predetermined. Further, when using the above method, the strings m_(x,0), m_(x,1), . . . , m_(x,nx) and m_(y,1), . . . , m_(k,ny) can be recovered directly from x_(0,m), x_(1,m), . . . , x_(nx,m) and y_(1,m), . . . , y_(ny,m), respectively. An extra bit is needed to identify whether (x_(0,m), x_(1,m), . . . , x_(nx,m), y_(0,m), y_(1,m), . . . , y_(1,m), . . . , y_(ny,m)) or

$\left( {{g\; x_{0,m}},{g\; x_{1,m}},\ldots \mspace{14mu},{g\; x_{{n\; x},m}},{g^{\frac{3}{2}}y_{0,m}},{g^{\frac{3}{2}}y_{1,m}},\ldots \mspace{14mu},{g^{\frac{3}{2}}y_{{n\; y},m}}} \right)$

is used at the sending correspondent. Additionally, any non-quadratic value in F(p) can be used for g. For efficiency, g is chosen to be −1 for p≡3 mod 4 and is chosen to be 2 for p≡1 mod 4. Further, at the receiver, the process is reversed. In the case of g=2, a division by two is carried out. It should noted that dividing x_(i,m) by two is computed using one modulo addition, because:

x _(i,m)/2=((x _(i,m)−(x _(i,m))mod 2)/2)+(x _(i,m))mod 2*(1/2)mod p;   (i)

(x_(i,m))mod 2 is the least significant bit of x_(i,m);   (ii) and

(1/2)mod p=(p+1)/2.   (iii)

In the following, it is assumed that F=F(p). In conventional elliptic polynomial cryptography, the cipher point is computed as:

(x _(0,c) , x _(1,c) , . . . , x _(nx,c) , y _(0,c) , y _(1,c) , . . . , y _(ny,c))=(x _(0,m) , x _(1,m) , . . . , x _(nx,m) , y _(0,m) , y _(1,m) , . . . , y _(ny,m))+(x_(0,bk) , x _(1,bk) , . . . , x _(nx,bk) , y _(0,bk) , y _(1,bk) , . . . , y _(ny,bk))

where (x_(0,m), x_(1,m), . . . , x_(nx,m), y_(0,m), y_(1,m), . . . , y_(ny,m)) is the message point and (x_(0,bk), x_(1,bk), . . . , x_(nx,bk), y_(0,bk), y_(1,bk), . . . , y_(ny,bk)) is referred to as “the encrypting point”, which is typically computed as the scalar multiplication of the shared secret key k and a base point (x_(0,B), x_(1,B), . . . , x_(nx,B), y_(0,B), y_(1,B), . . . , y_(ny,B)), which is known publicly, such that:

(x _(0,bk) , x _(1,bk) , . . . , x _(nx,bk), y_(0,bk) , y _(1,bk) , . . . , y _(ny,bk))=k(x _(0,B) , x _(1,B) , . . . , x _(nx,B) , y _(0,B) , y _(1,B) , . . . , y _(ny,B))

where all of the coordinates are elements of the underlying field F(p), and which are presented in N-bits.

In the present method, the underlying elliptic polynomial cryptography is based on the principle of blinding the base point by making the base point dependant on the shared secret key. In a first embodiment, the shared secret key is represented using nN-bits, where n is greater than or equal to (nx+ny+2). The nN bits of the shared secret key could be given as one block, or may alternatively be generated using a smaller bit-string and a random number generator.

When n=2(nx+ny+2), various techniques may be used to generate the encrypting point (x_(0,bk), x_(1,bk), . . . , x_(nx,bk), y_(0,bk), y_(1,bk), . . . , y_(ny,bk)). In the preferred embodiment, which utilizes one blinded base point, (nx+ny+1)N-bits of the shared secret key bit-string k1 are embedded into the x-coordinates and the y-coordinates of an elliptic polynomial point to obtain a blinded base point (x_(0,k1), x_(1,k1), . . . , x_(nx,k1), y_(0,k1), y_(1,k1), . . . , y_(ny,k1)). The other (nx+ny+2)N-bits of the key are used as a scalar value k2, which is then multiplied by the blinded base point to obtain the encrypting point:

(x _(0,bk) , x _(1,bk) , . . . , x _(nx,bk) , y _(0,bk) , y _(1,bk) , . . . , y _(ny,bk))=k2(x _(0,k1) , x _(1,k1) , . . . , x _(nx,k1) , y _(0,k1) , y _(1,k1) , . . . , y _(ny,k1)).

In an alternative embodiment, one blinded base point and one public base point are utilized. In this embodiment, (nx+ny+1)N-bits of the shared secret key bit-string k1 are embedded into the x-coordinates and the y-coordinates of an elliptic curve point to obtain a blinded base point (x_(0,k1), x_(1,k1), . . . , x_(nx,k1), y_(0,k1), y_(1,k1), . . . , y_(ny,k1)). The other N-bits of the key are used as a scalar value k2 that is multiplied by the public base point (x_(0,B), x_(1,B), . . . , x_(nx,B), y_(0,B), y_(1,B), . . . , y_(ny,B)), with the encrypting point being obtained by:

(x _(0,bk) , x _(1,bk) , . . . , x _(nx,bk) , y _(0,bk) , y _(1,bk) , . . . , y _(ny,bk))=(x _(0,k1) , x _(1,k1) , . . . , x _(nx,k1) , y _(0,k1) , y _(1,k1) , . . . , y _(ny,k1))+k2(x _(0,B) , x _(1,B) , . . . , x _(nx,B) , y _(0,B) , y _(1,B) , . . . , y _(ny,B))

In another alternative embodiment, two blinded base points are utilized. In this embodiment, the two blinded points are generated from the 2(nx+ny+2)N-bits of the shared secret key bit-string. One blinded point (x_(0,k1), x_(1,k1), . . . , x_(nx,k1), y_(0,k1), y_(1,k1), . . . , y_(ny,k1)) is generated from (nx+ny+1)N-bits out of the (nx+ny+2)N-bits of the shared secret key bit-string, while the other blinded base point (x_(0,k2), x_(1,k2), . . . , x_(nx,k2), y_(0,k2), y_(1,k2), . . . , y_(ny,k2)) is obtained from a different (nx+ny+1)N-bits combination of the 2(nx+ny+2)N-bits of the shared secret key bit-string. Part of the key used to generate the point (x_(0,k1), x_(1,k1), . . . , x_(nx,k1), y_(0,k1), y_(1,k1), . . . , y_(ny,k1)), k₁, is used as a scalar and multiplied by the point (x_(0,k2), x_(1,k2), . . . , x_(nx,k2), y_(0,k2), y_(1,k2), . . . , y_(ny,k2)) to obtain the scalar multiplication k1(x_(0,k2), x_(1,k2), . . . , x_(nx,k2)y_(0,k2), y_(1,k2), . . . , y_(ny,k2)). The other part of the key used to generate the point (x_(0,k2), x_(1,k2), . . . , x_(nx,k2), y_(0,k2), y_(1,k2), . . . , y_(ny,k2)), k₂ is used as a scalar and multiplied by the point (x_(0,k1), x_(1,k1), . . . , y_(0,k1), y_(1,k1), . . . , y_(ny,k1)) to obtain the scalar multiplication k2(x_(0,k1), x_(1,k1), . . . , x_(nx,k1), y_(0,k1), y_(1,k1), . . . , y_(ny,k1)). The encrypting point can be selected using a first scalar multiplication and addition:

(x _(0,bk) , x _(1,bk) , . . . , x _(nx,bk) y _(0,bk) , y _(1,bk) , . . . , y _(ny,bk))=k2(x _(0,k1) , x _(1,k1) , . . . , y _(0,k1) , y _(1,k1) , . . . , y _(ny,k1))+k1(x _(0,k2) , x _(1,k2) , . . . , x _(nx,k2) , y _(0,k2) , y _(1,k2) , . . . , y _(ny,k2))

or, alternatively, a scalar multiplication and addition as:

(x _(0,bk) , x _(1,bk) , . . . , x _(nx,bk) , y _(0,bk) , y _(1,bk) , . . . , y _(ny,bk))=(x _(0,k1) , x _(1,k1) , . . . , x _(nx,k1) , y _(0,k1), y_(1,k1) , . . . , y _(ny,k1))+k1(x _(0,k2) , x _(1,k2) , . . . , x _(nx,k2) , y _(0,k2) , y _(1,k2) , . . . , y _(ny,k2))

or, in a further alternative, a scalar multiplication and addition given by:

(x _(0,bk) , x _(1,bk) , . . . , x _(nx,bk) , y _(0,bk) , y _(1,bk) , . . . , y _(ny,bk))=k2(x _(0,k1) , x _(1,k1) , . . . , x _(nx,k1) , y _(0,k1) , y _(1,k1) , . . . , y _(ny,k1))+(x _(0,k2) , x _(1,k2) , . . . , x _(nx,k2) , y _(0,k2) , y _(1,k2) , . . . , y _(ny,k2)).

In a first embodiment, the elliptic polynomial encryption method includes the following steps (where it is assumed that the data bit stream is encrypted in blocks of M-bits where (nx+ny+1)N>M>N−1, where N is the number of bits needed to represent the elements of f(p): (a) defining a maximum block size that can be embedded into (nx+1) x-coordinates and ny y-coordinates, wherein n is an integer, and setting the maximum block size to be (nx+ny+1)N bits, wherein N is an integer; (b) a sending correspondent and a receiving correspondent agree upon the values of nx and ny, and further agree on a set of coefficients a_(1k), a_(2kl), a_(3k), c_(1lki), c_(2kl), c_(3kli), b_(1l), b_(2lk), b_(3lk), b_(4k) & b_(c) ∈ F, wherein F represents a finite field where the field's elements can be represented in N-bits, the sending and receiving correspondents further agreeing on a set of random numbers k_(r,j,i), k_(s,j,i), k_(x,i,j,l), k_(y,i,j,l), where l=1, . . . N_(p), the set of random numbers being shared secret keys for communication, wherein N_(p)≧1, the sending and receiving correspondents further agreeing on a base point on an elliptic polynomial (x_(0,B), x_(1,B), . . . , x_(nx,B), y_(0,B), y_(1,B), . . . , y_(ny,B)) ∈ EC^(xn+ny+2), wherein EC^(nx+ny+2) represents the elliptic polynomial.

The sending correspondent then performs the following steps: (c) establishing an integer index /such that a first block is defined by j=0, and embedding a j^(th) block of a secret message bit string into an elliptic curve message point (x_(0,m,j), x_(1,m,j), . . . , x_(nx,m,j), y_(0,m,j), y_(1,m,j), . . . , y_(ny,m,j)); (d) embedding the, j^(th) block shared secret key bit strings k_(x,0,j,l), k_(x,1,j,l), . . . , k_(x,nx,j,l) and k_(y,1,j,l), . . . , k_(k,ny,j,l) into a set of elliptic curve key points (xk_(x,0,j,l), xk_(x,1,j,l), . . . , xk_(x,nx,j,l), yk_(y,0,j,l), yk_(y,1,j,l), . . . , yk_(y,ny,j,l)), where l=1, . . . N_(p), and wherein the set of elliptic curve key points satisfy the elliptic polynomial at the elliptic curve message point; (e) calculating the set of elliptic curve key points (xr_(x,0,j,l), xr_(x,1,j,l), . . . , xr_(x,nx,j,l), yr_(y,0,j,l), yr_(y,1,j,l), . . . , yr_(ny,1,j,l)) as:

(xr _(x,0,j,l) , xr _(x,1,j,l) , . . . , xr _(x,nx,j,l) , yr _(y,0,j,l) , yr _(y,1,j,l) , . . . , yr _(y,ny,j,l))=+k _(r,j,l)(xr _(x,0,j−1,l) , xr _(x,1,j−1,l) , . . . , xr _(x,nx,j,l) , yr _(y,0,j−1,l) , yr _(y,1,j−1,l) , . . . , yr _(y,ny,j−1,l))+k _(s,j,l)(xk_(x,0,j,l) , xk _(x,1,j,l) , . . . , xk _(x,nx,j,l) , yk _(y,0,j,l) , yk _(y,y,1,j,l) , . . . , yk _(y,ny,j,l))

based upon the shared secret keys k_(r,j,i) and k_(s,j,i); (f) calculating a cipher point of the j^(th) data block (x_(c,0,j), x_(c,1,j), . . . , x_(nx,j), y_(c,0,j), y_(c,1,j), . . . , y_(c,ny,j)) as:

${\left( {x_{c,0,j},x_{c,1,j},\ldots \mspace{14mu},x_{c,{nx},j},y_{c,0,j},y_{c,1,j},\ldots \mspace{14mu},y_{c,{ny},j}} \right) = {{+ \left( {x_{m,0,j},x_{m,1,j},\ldots \mspace{14mu},x_{m,{nx},j},y_{m,0,j},y_{m,1,j},\ldots \mspace{14mu},y_{m,{ny},j}} \right)} + {\sum\limits_{l = 1}^{N_{P}}\left( {{xr}_{x,0,j,l},{xr}_{x,1,j,l},\ldots \mspace{14mu},{xr}_{x,{nx},j,l},{yr}_{y,0,j,l},{yr}_{y,1,j,l},\ldots \mspace{14mu},{yr}_{y,{ny},j,l}} \right)}}};$

(g) sending appropriate bits of the x-coordinates and the y-coordinates of the cipher point (_(c,0,j), x_(c,1,j), . . . , x_(c,nx,j), y_(c,0,j), y_(c,1,j), . . . , y_(c,ny,j)) to the receiving correspondent, together with any other information needed to recover the message point without sacrificing security; (h) generating a new set of shared secret keys k_(r,j+1,i), k_(s,j+1,i), k_(x,i,j+1,l), k_(y,i,j+1,l) for l=1, . . . N_(p) for encryption of a following block of the message data bit string using at least one random number generators and the set of keys k_(r,j,i), k_(s,j,i), k_(x,i,j,l), k_(y,i,j,l) for l=1, . . . N_(p); and (i) returning to step c) to encrypt the following block of the message data bit string.

The receiving correspondent then performs the following steps: (j) embedding the j^(th) block of the shared secret message bit strings k_(x,0,j,l), k_(x,1,j,l), . . . , k_(x,nx,j,l) and k_(y,1,j,l), . . . , k_(k,ny,j,l) into the elliptic curve key points (xk_(x,0,j,l), xk_(x,1,j,l), . . . , xk_(x,nx,j,l), yk_(y,0,j,l), yk_(y,1,j,l), . . . , yk_(y,ny,j,l)), wherein the set of elliptic curve key points satisfy the elliptic polynomial, which may be received from the sending correspondent; (k) calculating the set of elliptic curve key points (xr_(x,0,j,l), xr_(x,1,j,l), . . . , xr_(x,nx,j,l), yr_(y,0,j,l), yr_(y,1,j,l), . . . , yr_(y,ny,j,l)) as:

(xr _(x,0,j,l) , xr _(x,1,j,l) , . . . , xr _(x,nx,j,l) , yr _(y,0,j,l) , yr _(y,1,j,l) , . . . , yr _(y,ny,j,l))=+k_(r,j,l)(xr_(x,0,j−1,l) , xr _(x,1,j−1,l) , . . . , xr _(x,nx,j−1,l) , yr _(y,0,j−1,l) , yr _(y,1,j−1,l) , . . . , yr _(y,ny,j−1,l))+k _(r,j,l)(xr _(x,0,j−1,l) , xr _(x,1,j−1,l) , . . . , xr _(x,nx,j−1,l) , yr _(y,0,j−1,l) , yr _(y,1,j−1,l) , . . . , yr _(y,ny,j−1,l))+k _(s,j,l)(xk _(x,0,j,l) , xr _(x,1,j,l) , . . . , xk _(x,nx,h,l) , yk _(y,0,j,l) , yk _(y,1,j,l) , . . . , yk _(y,ny,j,l))

based upon the shared secret keys k_(r,j,i) and k_(s,j,i); (l) calculating the message point of the j^(th) data block (x_(m,0,j), x_(m,1,j), . . . , x_(m,nx,j), y_(m,0,j), y_(m,1,j), . . . , y_(m,ny,j)) as:

$\left( {x_{c,0,j},x_{c,1,j},\ldots \mspace{14mu},x_{c,{nx},j},y_{c,0,j},y_{c,1,j},\ldots \mspace{14mu},y_{c,{ny},j}} \right) = {{+ \left( {x_{m,0,j},x_{m,1,j},\ldots \mspace{14mu},x_{m,{nx},j},y_{m,0,j},y_{m,1,j},\ldots \mspace{14mu},y_{m,{ny},j}} \right)} + {\sum\limits_{l = 1}^{N_{P}}\left( {{xr}_{x,0,j,l},{xr}_{x,1,j,l},\ldots \mspace{14mu},{xr}_{x,{nx},j,l},{yr}_{y,0,j,l},{yr}_{y,1,j,l},\ldots \mspace{14mu},{yr}_{y,{ny},j,l}} \right)}}$

together with any other information sent by the sending correspondent needed to recover the message point without sacrificing security; (m) recovering the secret messages bit string for the j^(th) block from the appropriate x-coordinates and y-coordinates of the message point (x_(m,0,j), x_(m,1,j), . . . , x_(m,nx,j), y_(m,0,j), y_(m,1,j), . . . , y_(m,ny,j)), and any information received from the sending correspondent; (n) generating the new set of shared secret keys k_(r,j+1,i), k_(s,j+1,i), k_(x,i,j+1,l), k_(y,i,j+1,l) for l=1, . . . N_(p) which are needed for the encryption of the next block of the message data bit string, using at least one random number generator and the keys k_(r,j,i), k_(s,j,i), k_(x,i,j,l), k_(y,i,j,l); and (o) returning to step (j) to encrypt the following block of the message data bit string.

A special case of the above method is when k_(r,j,l)=k_(s,j,l)=1 for l=1, . . . , N_(P). In this case, no scalar multiplication is needed to calculate the points (xr_(x,0,j,l), xr_(x,1,j,l), . . . , xr_(x,nx,j,l), yr_(y,0,j,l), yr_(y,1,j,l), . . . , yr_(y,ny,j,l)), for l=1, . . . , N_(P) , which can be computed using one point addition:

(xr _(x,0,j,l) , xr _(x,1,j,l) , . . . , xr _(x,nx,j,l) , yr _(y,0j,l) , yr _(y,1,j,l) , . . . , yr _(y,ny,j,l))=+(xr _(x,0,j−1,l) , xr _(x,1,j−1,l) , . . . , xr _(x,nx,j−1,l) , yr _(y,0,j−1,l) , yr _(y,1,j−1,l) , . . . , yr _(y,ny,j−1,l)) (xk_(x,0,j,l), xk_(x,1,j,l), . . . , xk_(x,na,j,l), yk_(y,0,j,l), yk_(y,1,j,l), . . . , yk_(y,ny,j,l)).

An alternative embodiment of the method includes using a non-linear process in generating the points: (xr_(x,0,j,l), xr_(x,1,j,l), . . . , xr_(x,nx,j,l), yr_(y,0,j,l), yr_(y,1,j,l), . . . , yr_(y,ny,j,l)), for l=1, . . . , N_(P), with the keys k_(r,j,i)=k_(s,j,l)=1, and then using the points: (xr_(x,0,j−1,l), xr_(x,1,j−1,l), . . . , xr_(x,nx,j−1,l), yr_(y,0,j−1,l), yr_(y,1,j−1,l), . . . , yr_(y,ny,j−1,l)) and (xk_(x,0,j,l), xk_(x,1,j,l), . . . , xk_(x,nx,j,l), yk_(y,0,j,l), yk_(y,1,j,l), . . . , yk_(y,ny,j,l)) for l=1, . . . , N_(P). (xr_(x,0,j,l), xr_(x,1,j,l), . . . , xr_(x,nx,j,l), yr_(y,0,j,l), yr_(y,1,j,l), . . . , yr_(y,ny,j,l)), for l=1, . . . , N_(P), are computed as:

(xr _(x,0,j,l) , xr _(x,1,j,l) , . . . , xr _(x,nx,j,l) , yr _(y,0,j,l) , yr _(y,1,j,l) , . . . , yr _(y,ny,j,l))=+k _(r,j,l)(xr′ _(x,0,j−1,l) , xr′ _(x,1,j−1,l) , . . . , xr′ _(x,nx,j−1,l) , yr′ _(y,0,j−1,l) , yr′ _(y,1,j−1,l) , . . . , yr′ _(y,ny,j−1,l))+k _(s,j,l)(xk _(x,0,j,l) , xk _(x,1,j,l) , . . . , xk _(x,nx,j,l) , yk _(y,0,j,l) , yk _(y,1,j,l) , . . . , yk _(y,ny,j,l))

where,

xr″ _(x,i,j,l)=ƒ_(x)(xr _(x,i,j−1,l) , yr _(z,i,j−1,l) |l=1, . . . , N _(P)) and

yr″ _(x,i,j,l)=ƒ_(y)(xr _(x,i,j−1,l) , yr _(z,i,j−1,l) |l=1, . . . , N _(P)),

and if yr″_(y,0,j−1,l) is quadratic residue, then:

(xr′ _(x,0,j−1,l) , xr′ _(x,1,j−1,l) , . . . , xr′ _(x,nx,j−1,l) , yr′ _(y,0,j−1,l) , yr′ _(y,1,j−1,l) , . . . , yr′ _(y,ny,j−1,l))=(xr″ _(x,0,j−1,l) , xr″ _(x,1,j−1,l) , . . . , xr″ _(x,nx,j−1,l) , yr″ _(y,0,j−1,l) , yr″ _(y,1,j−1,l) , . . . , yr″ _(y,ny,j−1,l))

otherwise:

$\left( {{xr}_{x,0,{j - 1},l}^{\prime},{xr}_{x,1,{j - 1},l}^{\prime},\ldots \mspace{14mu},{xr}_{x,{nx},{j - 1},l}^{\prime},{yr}_{y,0,{j - 1},l}^{\prime},{yr}_{y,1,{j - 1},l}^{\prime},\ldots \mspace{14mu},{yr}_{y,{ny},{j - 1},l}^{\prime}} \right) = \left( {{gxr}_{x,0,{j - 1},l}^{''},{gxr}_{x,1,{j - 1},l}^{''},\ldots \mspace{14mu},{gxr}_{x,{nx},{j - 1},l}^{''},{g^{\frac{3}{2}}{yr}_{y,0,{j - 1},l}^{''}},{g^{\frac{3}{2}}{yr}_{y,1,{j - 1},l}^{''}},\ldots \mspace{14mu},{g^{\frac{3}{2}}{yr}_{y,{ny},{j - 1},l}^{''}}} \right)$

where ƒ_(x)(.) and ƒ_(y)(.) are any non-linear functions.

Both the transmitting correspondent and the receiving correspondent perform the same non-linear function in generating the points (xr_(x,0,j,l), xr_(x,1,j,l), . . . , xr_(x,nx,j,l), yr_(y,0,j,l), yr_(y,1,j,l), . . . , yr_(y,ny,j,l)), for l=1, . . . , N_(P).

As noted above, the methods include data embedding. In order to embed a message bit string into a point (x, √{square root over (α)}y) which satisfies either an elliptic curve equation y²=x³ax+b or its twist, αy²=x³+ax+b, the message bit string is first divided into N-bit strings and the i^(th) block is denoted as m_(i). Following this, the value of the bit string of m_(i) is assigned to x_(m) _(i) , and the values of x_(m) _(i) are substituted and the value of t_(m) _(i) is computed using t_(m) _(i) =x_(m) _(i) ³+ax_(m) _(i) +b.

If t_(m) _(i) is quadratic residue, then y_(m) _(i) =√{square root over (t_(m) _(i) )} and the point is given as (x_(m) _(i) , y_(m) _(i) ). However, if t_(m) _(i) is non-quadratic residue, then

$y_{m_{i}} = \sqrt{\frac{t_{m_{i}}}{\overset{\_}{\alpha}}}$

and the point is given as (x_(m) _(i) , √{square root over ({tilde over (α)}y_(m) _(i) ). The message point is then denoted as (x_(m) _(i) , √{square root over (α_(m) _(i) )}y_(m) _(i) ), where the point is on the elliptic curve if α_(m) _(i) =1, and the point is on the twist if α_(m) _(i) = α.

Alternatively, data embedding may be performed as follows: (a) dividing the message bit string into (nx+ny+1) bit-strings m_(x,0), m_(x,1), . . . , m_(x,nx), m_(y,1), . . . , m_(k,ny); (b) assigning the value of the bit string of m_(x,0), m_(x,1), . . . , m_(x,nx) to x_(0,m), x_(1,m), . . . , x_(nx,m); (c) assigning the value of the bit string of to m_(y,1), . . . , m_(k,ny) to y_(1,m), . . . , y_(ny,m); (d) computing

${T^{({s - 1})} = {{\sum\limits_{l \in S_{nx}}{b_{1l}x_{l}^{3}}} + {\sum\limits_{l,{k \in S_{nx}},{l \neq k}}{b_{2{lk}}x_{l}^{2}x_{k}}}}};$

and (e) performing a Legendre test to determine if T has a square root, wherein if T has a square root, then assigning the square root to y₀, and if T does not have a square root, then the x-coordinates and y-coordinates of the elliptic polynomial point with the embedded shared secret key bit string are selected as gx_(i,m) and

${g^{\frac{2}{3}}y_{i,m}},$

respectively, where g is non-quadratic residue in F.

The Legendre Symbol is used to test whether an element of F(p) has a square root or not, i.e., whether an element is quadratic residue or not. The Legendre Symbol and test are as follows. Given an element of a finite field F(p), such as d, the Legendre symbol is defined as (d/p). In order to test whether d is quadratic residue or not, the Legendre symbol, (d/p), is computed such that:

$\left( \frac{d}{p} \right) = \left\{ \begin{matrix} {+ 1} & {{if}\mspace{14mu} x\mspace{14mu} {is}\mspace{14mu} {quadratic}\mspace{14mu} {residue}} \\ 0 & {{{if}\mspace{14mu} x} \equiv {0\mspace{14mu} {mod}\mspace{14mu} {F(p)}}} \\ {- 1} & {{otherwise}.} \end{matrix} \right.$

In the above, the password protocols use the scalar multiplication k_(m)(x_(Pu), y_(Pu)). It should be noted that, in order to find a collision means, that there are two message bits strings m and m′ such that their integer values k_(m) and k_(m′) will lead to k_(m)k(x_(B), y_(B))≡k_(m′)k(x_(B), y_(B)). This collision implies that integers can be found such that k_(m)k−k_(m),k=l*#EC, where #EC is the order of the group (EC,+). This is equivalent to solving the elliptic curve discrete logarithm problem. This also applies to finding a collision for the points on the twist of an elliptic curve, k_(m)k(x_(TB), √{square root over ( αy_(TB))=k_(m′)k(x_(TB), √{square root over ( αy_(TB)).

Thus, security of the password protocols depends on the security of the underlying elliptic polynomial cryptography. The security of elliptic polynomial cryptosystems is assessed by both the effect on the solution of the elliptic curve discrete logarithmic problem (ECDLP) and power analysis attacks.

It is well known that the elliptic curve discrete logarithm problem (ECDLP) is apparently intractable for non-singular elliptic curves. The ECDLP problem can be stated as follows: given an elliptic curve defined over F that needs N-bits for the representation of its elements, an elliptic curve point (x_(P), y_(P)) ∈ EC, defined in affine coordinates, and a point (x_(Q), y_(Q)) 531 EC, defined in affine coordinates, determine the integer k,0≦k≦#F, such that (x_(Q), y_(Q))=k(x_(P), y_(P)), provided that such an integer exists. In the below, it is assumed that such an integer exists.

The most well known attack used against the ECDLP is the Pollard ρ-method, which has a complexity of O(√{square root over (πK)}/2), where K is the order of the underlying group, and the complexity is measured in terms of an elliptic curve point addition.

Since the underlying cryptographic problems used in the above block cipher chaining methods is the discrete logarithm problem, which is a known difficult mathematical problem, it is expected that the security of the above methods are more secure than prior art ciphers which are not based on such a mathematically difficult problem.

Projective coordinate can also be used by the sending correspondent and the receiving correspondent to embed extra message data bits in the projective coordinate wherein the addition of the corresponding elliptic points is defined in (nx+ny+3) dimensional space where there are (nx+1) x-coordinates, (ny+1) y-coordinates and one projective coordinate.

The equations for the addition rule can be obtained by using the elliptic polynomial equation with (nx+1) x-coordinates and (nx+1) y-coordinates in projective coordinates and substituting a straight line equation to obtain a cubic equation in terms of one of the x-coordinates. This cubic equation can be used to identify the third point of intersection between a straight line and the elliptic polynomial in (nx+ny+3) dimensions given two other intersection points. This third point of intersection is used to identify the sum of the given two points.

It should be understood that the calculations may be performed by any suitable computer system, such as that diagrammatically shown in the sole drawing Figure. Data is entered into system 100 via any suitable type of user interface 116, and may be stored in memory 112, which may be any suitable type of computer readable and programmable memory. Calculations are performed by processor 114, which may be any suitable type of computer processor and may be displayed to the user on display 118, which may be any suitable type of computer display.

Processor 114 may be associated with, or incorporated into, any suitable type of computing device, for example, a personal computer or a programmable logic controller. The display 118, the processor 114, the memory 112 and any associated computer readable recording media are in communication with one another by any suitable type of data bus, as is well known in the art.

Examples of computer-readable recording media include a magnetic recording apparatus, an optical disk, a magneto-optical disk, and/or a semiconductor memory (for example, RAM, ROM, etc.). Examples of magnetic recording apparatus that may be used in addition to memory 112, or in place of memory 112, include a hard disk device (HDD), a flexible disk (FD), and a magnetic tape (MT). Examples of the optical disk include a DVD (Digital Versatile Disc), a DVD-RAM, a CD-ROM (Compact Disc-Read Only Memory), and a CD-R (Recordable)/RW.

It is to be understood that the present invention is not limited to the embodiments described above, but encompasses any and all embodiments within the scope of the following claims. 

1. A computerized method of performing elliptic polynomial cryptography with secret key embedding, comprising the steps of: (a) defining a maximum block size that can be embedded into (nx+1) x-coordinates and ny y-coordinates, wherein n is an integer, and setting the maximum block size to be (nx+ny+1)N bits, wherein N is an integer; (b) a sending correspondent and a receiving correspondent agreeing upon the values of nx and ny, and further agreeing on a set of coefficients a_(1k), a_(2kl), a_(3k), c_(1lki), c_(2kl), c_(3kli), b_(1l), b_(2lk), b_(3lk), b_(4lk) & b_(c) ∈ F, wherein F represents a finite field where the field's elements can be represented in N-bits, the sending and receiving correspondents further agreeing on a set of random numbers k_(r,j,i), k_(s,j,i, k) _(x,i,j,l), k_(y,i,j,l), where l=1, . . . N_(p), the set of random numbers being shared secret keys for communication, wherein N_(P)≧1, the sending and receiving correspondents further agreeing on a base point on an elliptic polynomial (x_(0,B), x_(1,B), . . . , x_(nx,B), y_(0,B), y_(1,B), . . . , y_(ny,B)) ∈ EC^(xn+ny+2), wherein EC^(nx+ny+2) represents the elliptic polynomial; the sending correspondent then performs the following steps: (c) establishing an integer index /such that a first block is defined by j=0, and embedding a j^(th) block of a secret message bit string into an elliptic curve message point (x_(0,m,j), x_(1,m,j), . . . , x_(nx,m,j), y_(0,m,j), y_(1,m,j), . . . , y_(ny,m,j)); (d) embedding the j^(th) block shared secret key bit strings k_(x,0,j,l), k_(x,1,j,l), . . . , k_(x,nx,j,l) and k_(y,1,j,l), . . . , k_(k,ny,j,l) into a set of elliptic curve key points (xk_(x,0,j,l), xk_(x,1,j,l), . . . , xk_(x,nx,j,l), yk_(y,0,j,l), yk_(y,1,j,l), . . . , yk_(y,ny,j,l)) where l=1, . . . , N_(p), and wherein the set of elliptic curve key points satisfy the elliptic polynomial at the elliptic curve message point; (e) calculating the set of elliptic curve key points (xr_(x,0,j,l), xr_(x1,j,l), . . . , xr_(x,nx,j,l), yr_(y,0,j,l), y_(y,1,j,l), . . . , y_(y,ny,j,l)) as: (xr _(x,0,j,l) , xr _(x,1,j,l) , . . . , xr _(x,nx,j,l) , yr _(y,0,j,l) , yr _(y,1,j,l) , . . . , yr _(y,ny,j,l))=+k _(r,j,l)(xr _(x,0,j−1,l) , xr _(x,1,j−1,l) , . . . , xr _(x,nx,j−1,l) , yr _(y,0,j−1,l) , yr _(y,1,j−1,l) , . . . , yr _(y,ny,j−1,l))+k _(s,j,l)(xk _(x,0,j,l) , xk _(x,1,j,l) , . . . , xk _(x,nx,j,l) , yk _(y,0,j,l) , yk _(y,1,j,l) , . . . , yk _(y,ny,j,l)) based upon the shared secret keys k_(r,j,i) and k_(s,j,i); (f) calculating a cipher point of the j^(th) data block (x_(c,0,j), x_(c,1,j), . . . , x_(c,nx,j), y_(c,0,j), y_(c,1,j), . . . , y_(c,ny,j)) as: ${\left( {x_{c,0,j},x_{c,1,j},\ldots \mspace{14mu},x_{c,{nx},j},y_{c,0,j},y_{c,1,j},\ldots \mspace{14mu},y_{c,{ny},j}} \right) = {{+ \left( {x_{m,0,j},x_{m,1,j},\ldots \mspace{14mu},x_{m,{nx},j},y_{m,0,j},y_{m,1,j},\ldots \mspace{14mu},y_{m,{ny},j}} \right)} + {\sum\limits_{l = 1}^{N_{P}}\left( {{xr}_{x,0,j,l},{xr}_{x,1,j,l},\ldots \mspace{14mu},{xr}_{x,{nx},j,l},{yr}_{y,0,j,l},{yr}_{y,1,j,l},\ldots \mspace{14mu},{yr}_{y,{ny},j,l}} \right)}}};$ (g) sending appropriate bits of the x-coordinates and the y-coordinates of the cipher point (x_(c,0,j), x_(c,1,j), . . . , x_(c,nx,j), y_(c,0,j), y_(c,1,j), . . . , y_(c,ny,j)) to the receiving correspondent; (h) generating a new set of shared secret keys k_(r,j+1,i), k_(s,j+1,i), k_(x,i,j+1,l), k_(y,i,j+1,l) for l=1, . . . N_(p) for encryption of a following block of the message data bit string using at least one random number generators and the set of keys k_(r,j,i,), k_(s,j,i), k_(x,i,j,l), k_(y,i,j,l) for l=1, . . . N_(p); (i) returning to step c) to encrypt the following block of the message data bit string; the receiving correspondent then performs the following steps: (j) embedding the j^(th) block of the shared secret message bit strings k_(x,0,j,l), k_(x,1,j,l), . . . , k_(x,nx,j,l) and k_(y,1,j,l), . . . , k_(k,ny,j,l) into the elliptic curve key points (xk_(x,o,j,l), xk_(x,1,j,l), . . . , xk_(x,nx,j,l), yk_(y,0,j,l), yk_(y,1,j,l), . . . , yk_(y,ny,j,l)), wherein the set of elliptic curve key points satisfy the elliptic polynomial; (k) calculating the set of elliptic curve key points (xr_(x,0,j,l), xr_(x,1,j,l), . . . , xr_(x,nx,j,l), yr_(y,0,j,l)yr_(y,1,j,l), . . . , yr_(y,ny,j,l)) as: (xr _(x,0,j,l) , xr _(x,1,j,l) , . . . , xr _(x,nx,j,l) , yr _(y,0,j,l) , yr _(y,1,j,l) , . . . , yr _(y,ny,j,l))=+k _(r,j,l)(xr _(x,0,j−1,l) , xr _(x,1,j−1,l) , . . . , xr _(x,nx,j−1,l) , yr _(y,0,j−1,l) , yr _(y,1,j−1,l) , . . . , yr _(y,ny,j−1,l))+k _(s,j,l)(xk _(x,0,j,l) , xk _(x,1,j,l) , . . . , xk _(x,nx,j,l), yk_(y,0,j,l) , yk _(y,1,j,l) , . . . , yk _(y,ny,j,l)) based upon the shared secret keys k_(r,j,i) and k_(s,j,i); (l) calculating the message point of the jh data block (x_(m,0,j), x_(m,1,j), . . . , x_(m,nx,j), y_(m,0,j), y_(m,1,j), . . . , y_(m,ny,j)) as: ${\left( {x_{c,0,j},x_{c,1,j},\ldots \mspace{14mu},x_{c,{nx},j},y_{c,0,j},y_{c,1,j},\ldots \mspace{14mu},y_{c,{ny},j}} \right) = {{+ \left( {x_{m,0,j},x_{m,1,j},\ldots \mspace{14mu},x_{m,{nx},j},y_{m,0,j},y_{m,1,j},\ldots \mspace{14mu},y_{m,{ny},j}} \right)} + {\sum\limits_{l = 1}^{N_{P}}\left( {{xr}_{x,0,j,l},{xr}_{x,1,j,l},\ldots \mspace{14mu},{xr}_{x,{nx},j,l},{yr}_{y,0,j,l},{yr}_{y,1,j,l},\ldots \mspace{14mu},{yr}_{y,{ny},j,l}} \right)}}};$ (m) recovering the secret messages bit string for the j^(th) block from the appropriate x-coordinates and y-coordinates of the message point (x_(m,0,j), x_(m,1,j), . . . , x_(m,nx,j), y_(m,0,j), y_(m,1,j), . . . , y_(m,ny,j)); (n) generating the new set of shared secret keys k_(r,j+1,i), k_(s,j+1,i), k_(x,i,j+1,l), k_(y,i,j+1,l) for l=1, . . . N_(p) for the encryption of the following block of the message data bit string, using at least one random number generator and the keys k_(r,j,i), k_(s,j,i), k_(x,i,j,l), k_(y,i,j,l); and (o) returning to step j) to encrypt the following block of the message data bit string.
 2. The computerized method of performing elliptic polynomial cryptography with secret key embedding as recited in claim 1, wherein the step of embedding includes the steps of: (a) dividing the message bit string into (nx+ny+1) bit-strings m_(x,0), m_(x,1), . . . , m_(x,nx), m_(y,1), . . . , m_(k,ny); (b) assigning the value of the bit string of m_(x,0), m_(x,1), . . . , m_(x,nx) to x_(0,m), x_(1,m), . . . , x_(nx,m); (c) assigning the value of the bit string of m_(y,1), . . . , m_(k,ny) to y_(1,m), . . . , y_(ny,m); (d) computing ${T^{({s - 1})} = {{\sum\limits_{l \in S_{nx}}{b_{1l}x_{l}^{3}}} + {\sum\limits_{l,{k \in S_{nx}},{l \neq k}}{b_{2{lk}}x_{l}^{2}x_{k}}}}};$ (e) performing a Legendre test to determine if T has a square root, wherein if T has a square root, then assigning the square root to y₀, and if T does not have a square root, then the x-coordinates and y-coordinates of the elliptic polynomial point with the embedded shared secret key bit string are selected as gx_(i,m), and ${g^{\frac{3}{2}}y_{i,m}},$ respectively, where g is non-quadratic residue in F.
 3. A system for performing elliptic polynomial cryptography with secret key embedding, comprising: a processor; computer readable memory coupled to the processor; a user interface coupled to the processor; a display coupled to the processor software stored in the memory and executable by the processor, the software having: means for defining a maximum block size that can be embedded into (nx+1) x-coordinates and ny y-coordinates, wherein n is an integer, and setting the maximum block size to be (nx+ny+1)N bits, wherein N is an integer; means for a sending correspondent and a receiving correspondent agree upon the values of nx and ny, and further agree on a set of coefficients a_(1k)a_(2kl), q_(3k), c_(1lki), c_(2kl), c_(3kli), b_(1l), b_(2lk), b_(3lk), b_(4k) & b_(c) ∈ F, wherein F represents a finite field where the field's elements can be represented in N-bits, the sending and receiving correspondents further agreeing on a set of random numbers k_(r,j,i), k_(s,j,i), k_(x,i,j,l), k_(y,i,j,l), where l=1, . . . N_(p), the set of random numbers being shared secret keys for communication, wherein N_(p)≧1, the sending and receiving correspondents further agreeing on a base point on an elliptic polynomial (x_(0,B), x_(1,B), . . . , x_(nx,B), y_(0,B), y_(1,B), . . . , y_(ny,B)) ∈ EC^(xn+ny+2), wherein EC^(nx+ny+2) represents the elliptic polynomial; means for establishing an integer index j such that a first block is defined by j=0, and embedding a j^(th) block of a secret message bit string into an elliptic curve message point (x,_(0,m,j), x_(1,m,j), . . . , x_(nx,m,j), y_(0,m,j), y_(1,m,j), . . . , y_(ny,m,j)); means for embedding the j^(th) block shared secret key bit strings and k_(x,0,j,l), k_(x,1,j,l), . . . , k_(x,nx,j,l) and k_(y,1,j,l), . . . , k_(k,ny,j,l) into a set of elliptic curve key points (xk_(x,0,j,l), xk_(x,1,j,l), . . . , xk_(x,nx,j,l), yk_(y,0,j,l), yk_(y,1,j,l), . . . , y_(y,ny,j,l)), where l=1, . . . N_(p), and wherein the set of elliptic curve key points satisfy the elliptic polynomial at the elliptic curve message point; means for calculating the set of elliptic curve key points (xr_(x,0,j,l), xr_(x,1,j,l), . . . , xr_(x,nx,j,l), yr_(y,0,j,l), yr_(y,1,j,l), . . . , yr_(y,ny,j,l)) as: (xr _(x,0,j,l) , xr _(x,1,j,l) , . . . , xr _(x,nx,j,l) , yr _(y,0,j,l) , yr _(y,1,j,l) , . . . , yr _(y,ny,j,l))=+k _(r,j,l)(xr _(x,0,j−1,l) , xr _(x,1,j−1,l) , . . . , xr _(x,nx,j−1,l) , yr _(y,0,j−1,l) , yr _(y,1,j−1,l) , . . . , yr _(y,ny,j−1,l))++k_(s,j,l)(xk _(x,0,j,l) , xk _(x,1,j,l) , . . . , xk _(x,nx,j,l) , yk _(y,0,j,l) , yk _(y,1,j,l) , . . . , yk _(y,ny,j,l)) based upon the shared secret keys k_(r,j,i) and k_(s,j,i); means for calculating a cipher point of the j^(th) data block (x_(c,0,j), x_(c,1,j), . . . , x_(c,nx,j), y_(c,0,j), y_(c,1,j), . . . , y_(c,ny,j)) as: ${\left( {x_{c,0,j},x_{c,1,j},\ldots \mspace{14mu},x_{c,{nx},j},y_{c,0,j},y_{c,1,j},\ldots \mspace{14mu},y_{c,{ny},j}} \right) = {{+ \left( {x_{m,0,j},x_{m,1,j},\ldots \mspace{14mu},x_{m,{nx},j},y_{m,0,j},y_{m,1,j},\ldots \mspace{14mu},y_{m,{ny},j}} \right)} + {\sum\limits_{l = 1}^{N_{P}}\left( {{xr}_{x,0,j,l},{xr}_{x,1,j,l},\ldots \mspace{14mu},{xr}_{x,{nx},j,l},{yr}_{y,0,j,l},{yr}_{y,1,j,l},\ldots \mspace{14mu},{yr}_{y,{ny},j,l}} \right)}}};$ means for sending appropriate bits of the x-coordinates and the y-coordinates of the cipher point (x_(c,0,j), x_(c,1,j), . . . , x_(c,nx,j), y_(c,0,j), y_(c,1,j), . . . , y_(c,ny,j)) to the receiving correspondent; means for generating a new set of shared secret keys k_(r,j+1,i), k_(s,j+1,i), k_(x,i,j+1,l), k_(y,i,j+1,l) for l=1, . . . N_(p) for encryption of a following block of the message data bit string using at least one random number generators and the set of keys k_(r,j,i), k_(s,j,i), k_(x,i,j,l), k_(y,i,j,l) for l=1, . . . N_(p); means for embedding the j^(th) block of the shared secret message bit strings k_(x,0,j,l), k_(x,1,j,l), . . . , k_(x,nx,j,l) and k_(y,1,j,l), . . . , k_(k,ny,j,l) into the elliptic curve key points (xk_(x,0,j,l), xk_(x,1,j,l), . . . , xk_(x,nx,j,l), yk_(y,0,j,l), yk_(y,1,j,l), . . . , yk_(y,ny,j,l)), wherein the set of elliptic curve key points satisfy the elliptic polynomial; means for calculating the set of elliptic curve key points (xr_(x,0,j,l), xr_(x,1,j,l), . . . , xr_(x,nx,j,l), yr_(y,0,j,l), yr_(y,1,j,l), . . . , yr_(y,ny,j,l)) as: (xr _(x,0,j,l) , xr _(x,1,j,l) , . . . , xr _(x,nx,j,l) , yr _(y,0,j,l) , yr _(y,1,j,l) , . . . , yr _(y,ny,j,l))=+k _(r,j,l)(xr _(x,0,j−1,l) , xr _(x,1,j−1,l) , . . . , xr _(x,nx,j−1,l) , yr _(y,0,j−1,l) , yr _(y,1,j−1,l) , . . . , yr _(y,ny,j−1,l))+k _(s,j,l)(xk _(x,0,j,l) , xk _(x,1,j,l) , . . . , xk _(x,nx,j,l) , yk _(y,0,j,l) , yk _(y,1,j,l) , . . . , yk _(y,ny,j,l)) based upon the shared secret keys k_(r,j,i) and k_(s,j,i); means for calculating the message point of the j^(th) data block (x_(m,0,j), x_(m,1,j), . . . , x_(m,nx,j), y_(m,0,j), y_(m,1,j), . . . , y_(m,ny,j)) as: ${\left( {x_{c,0,j},x_{c,1,j},\ldots \mspace{14mu},x_{c,{nx},j},y_{c,0,j},y_{c,1,j},\ldots \mspace{14mu},y_{c,{ny},j}} \right) = {{+ \left( {x_{m,0,j},x_{m,1,j},\ldots \mspace{14mu},x_{m,{nx},j},y_{m,0,j},y_{m,1,j},\ldots \mspace{14mu},y_{m,{ny},j}} \right)} + {\sum\limits_{l = 1}^{N_{P}}\left( {{xr}_{x,0,j,l},{xr}_{x,1,j,l},\ldots \mspace{14mu},{xr}_{x,{nx},j,l},{yr}_{y,0,j,l},{yr}_{y,1,j,l},\ldots \mspace{14mu},{yr}_{y,{ny},j,l}} \right)}}};$ means for recovering the secret messages bit string for the j^(th) block from the appropriate x-coordinates and y-coordinates of the message point (x_(m,0,j), x_(m,1,j), . . . , x_(m,nx,j), y_(m,0,j), y_(m,1,j), . . . , y_(m,ny,j)); means for generating the new set of shared secret keys k_(r,j+1,i), k_(s,j+1,i), k_(x,i,j+1,l), k_(y,i,j+1,l) for l=1, . . . N_(p) for the encryption of the following block of the message data bit string, using at least one random number generator and the keys k_(r,j,i), k_(s,j,i), k_(x,i,j,l), k_(y,i,j,l).
 4. A computer software product that includes a medium readable by a processor, the medium having stored thereon a set of instructions for performing elliptic polynomial cryptography with secret key embedding, the instructions comprising: (a) a first sequence of instructions which, when executed by the processor, causes the processor to define a maximum block size that can be embedded into (nx+1) x-coordinates and ny y-coordinates, wherein n is an integer, and setting the maximum block size to be (nx+ny+1)N bits, wherein N is an integer, wherein a sending correspondent and a receiving correspondent agree upon the values of nx and ny, and further agree on a set of coefficients a_(1k), a_(2kl), a_(3k), c_(1lki), c_(2kl), c_(3kli), b_(1l), b_(2lk), b_(3lk), b_(4k) & b_(c) ∈ F, wherein F represents a finite field where the field's elements can be represented in N-bits, the sending and receiving correspondents further agreeing on a set of random numbers k_(r,j,i), k_(s,j,i), k_(x,i,j,l), k_(y,i,j,l), where l=1, . . . N_(p), the set of random numbers being shared secret keys for communication, wherein N_(P)≧1, the sending and receiving correspondents further agreeing on a base point on an elliptic polynomial (x_(0,B), x_(1,B), . . . , x_(nx,B), y_(0,B),y_(1,B), . . . , y_(ny,B)) ∈EC^(xn+ny+2), wherein EC^(nx+ny+2) represents the elliptic polynomial; (b) a second sequence of instructions which, when executed by the processor, causes the processor to establish an integer index j such that a first block is defined by j=0, and embedding a j^(th) block of a secret message bit string into an elliptic curve message point (x_(0,m,j, x) _(1,m,j), . . . , x_(nx,m,j), y_(0,m,j), y_(1,m,j), . . . , y_(ny,m,j)); (c) a third sequence of instructions which, when executed by the processor, causes the processor to embed the j^(th) block shared secret key bit strings k_(x,0,j,l), k_(x,1,j,l), . . . , k_(x,nx,j,l) and k_(y,1,j,l), . . . , k_(k,ny,j,l) into a set of elliptic curve key points (xk_(x,0,j,l), xk_(x,1,j,l), . . . , xk_(x,nx,j,l), yk_(y,0,j,l), yk_(y,1,j,l), . . . , yk_(y,ny,j,l)), where l=1, . . . N_(p), and wherein the set of elliptic curve key points satisfy the elliptic polynomial at the elliptic curve message point; (d) a fourth sequence of instructions which, when executed by the processor, causes the processor to calculate the set of elliptic curve key points (xr_(x,0,j,l), xr_(x,1,j,l), . . . , xr_(x,nx,j,l), yr_(y,0,j,l), yr_(y,1,j,l), . . . , yr_(y,ny,j,l)) as: (xr _(x,0,j,l) , xr _(x,1,j,l) , . . . , xr _(x,nx,j,l) , yr _(y,0,j,l) , yr _(y,1,j,l) , . . . , yr _(y,ny,j,l))=+k _(r,j,l)(xr _(x,0,j−1,l) , xr _(x,1,j−1,l) , . . . , xr _(x,nx,j−1,l) , yr _(y,0,j−1,l) , yr _(y,1,j−1,l) , . . . , yr _(y,ny,j−1,l))+k _(s,j,l)(xk _(x,0,j) , xk _(x,1,j,l) , . . . , xk _(x,nx,j,l) , yk _(y,0,j,l), yk_(y,1,j,l) , . . . , yk _(y,ny,j,l)) based upon the shared secret keys k_(r,j,i) and k_(s,j,i); (e) a fifth sequence of instructions which, when executed by the processor, causes the processor to calculate a cipher point of the j^(th) data block (x_(c,0,j), x_(c,1,j), . . . , x_(c,nx,j), y_(c,0,j), y_(c,1,j), . . . , y_(c,ny,j)) as: ${\left( {x_{c,0,j},x_{c,1,j},\ldots \mspace{14mu},x_{c,{nx},j},y_{c,0,j},y_{c,1,j},\ldots \mspace{14mu},y_{c,{ny},j}} \right) = {{+ \left( {x_{m,0,j},x_{m,1,j},\ldots \mspace{14mu},x_{m,{nx},j},y_{m,0,j},y_{m,1,j},\ldots \mspace{14mu},y_{m,{ny},j}} \right)} + {\sum\limits_{l = 1}^{N_{P}}\left( {{xr}_{x,0,j,l},{xr}_{x,1,j,l},\ldots \mspace{14mu},{xr}_{x,{nx},j,l},{yr}_{y,0,j,l},{yr}_{y,1,j,l},\ldots \mspace{14mu},{yr}_{y,{ny},j,l}} \right)}}};$ (f) a sixth sequence of instructions which, when executed by the processor, causes the processor to send appropriate bits of the x-coordinates and the y-coordinates of the cipher point (x_(c,0,j), x_(c,1,j), . . . , x_(c,nx,j), y_(c,0,j), y_(c,1,j), . . . , y_(c,ny,j)) to the receiving correspondent; (g) a seventh sequence of instructions which, when executed by the processor, causes the processor to generate a new set of shared secret keys k_(r,j+1,i), k_(s,j+1,i), k_(x,i,j+1,l), k_(y,i,j+1,l) for l=1 , . . . N_(p) for encryption of a following block of the message data bit string using at least one random number generators and the set of keys k_(r,j,i), k_(s,j,i), k_(x,i,j,l), k_(y,i,j,l) for l=1, . . . N_(p); (h) an eighth sequence of instructions which, when executed by the processor, causes the processor to embed the j^(th) block of the shared secret message bit strings k_(x,0,j,l), k_(x,1,j,l), . . . , k_(x,nx,j,l) and k_(y,1,j,l), . . . , k_(y,ny,j,l) into the elliptic curve key points (xk_(x,0,j,l), xk_(x,1,j,l), . . . , xk_(x,nx,j,l), . . . , yk_(y,0,j,l), yk_(y,1,k,l), . . . , yk_(y,ny,j,l)), wherein the set of elliptic curve key points satisfy the elliptic polynomial; (i) a ninth sequence of instructions which, when executed by the processor, causes the processor to calculate the set of elliptic curve key points (xr_(x,0,j,l), xr_(x,1,j,l), . . . , xr_(x,nx,j,l), yr_(y,0,j,l), yr_(y,1,j,l), . . . , yr_(y,ny,j,l)) as: (xr _(x,0,j,l) , xr _(x,1,j,l) , . . . , xr _(x,nx,j,l) , yr _(y,0,j,l) yr _(y,1,j,l) , . . . , yr _(y,ny,j,l))=+k _(r,j,l)(xr_(x,0,j−1,l) , xr _(x,1,j−1,l) , . . . , xr _(x,nx,j−1,l) , yr _(y,0,j−1,l) , y _(y,1,j−1,l) , . . . , yr _(y,ny,j−1,l))+k _(s,j,l)(xk _(x,0,j,l) , xk _(x,1,j,l) , . . . , xk _(x,nx,j,l) , yk _(y,0,j,l) , yk _(y,1,j,l) , . . . , yk _(y,ny,j,l)) based upon the shared secret keys k_(r,j,i) and k_(s,j,i); (j) a tenth sequence of instructions which, when executed by the processor, causes the processor to calculate the message point of the j^(th) data block (x_(m,0,j), x_(m,1,j), . . . , x_(m,nx,j), y_(m,0,j), y_(m,1,j), . . . , y_(m,ny,j)) as: ${\left( {x_{c,0,j},x_{c,1,j},\ldots \mspace{14mu},x_{c,{nx},j},y_{c,0,j},y_{c,1,j},\ldots \mspace{14mu},y_{c,{ny},j}} \right) = {{+ \left( {x_{m,0,j},x_{m,1,j},\ldots \mspace{14mu},x_{m,{nx},j},y_{m,0,j},y_{m,1,j},\ldots \mspace{14mu},y_{m,{ny},j}} \right)} + {\sum\limits_{l = 1}^{N_{P}}\left( {{xr}_{x,0,j,l},{xr}_{x,1,j,l},\ldots \mspace{14mu},{xr}_{x,{nx},j,l},{yr}_{y,0,j,l},{yr}_{y,1,j,l},\ldots \mspace{14mu},{yr}_{y,{ny},j,l}} \right)}}};$ (k) an eleventh sequence of instructions which, when executed by the processor, causes the processor to recover the secret messages bit string for the j^(th) block from the appropriate x-coordinates and y-coordinates of the message point (x_(m,0,j), x_(m,1,j), . . . , x_(m,nx,j), y_(m,0,j), y_(m,1,j), . . . , y_(m,ny,j)); and (l) a twelfth sequence of instructions which, when executed by the processor, causes the processor to generate the new set of shared secret keys k_(r,j+1,l), k_(s,j+1,i), k_(x,i,j+1,l), k_(y,i,j+1,l) for l=1, . . . N_(p) for the encryption of the following block of the message data bit string, using at least one random number generator and the keys k_(r,j,i), k_(s,j,i), k_(x,i,j,l), k_(y,i,j,l). 